On Clustered Graph Layouts Sketched by Users Based on Predefined Clusters
Pages 143 - 145
Abstract
The aesthetics for user-sketched layouts of clustered graphs with known clustering information is analyzed empirically. In our experiments, given the adjacency list of a clustered graph and its predefined clustering information, each participant was asked to manually sketch clustered graphs "nicely" from scratch on a tablet system using a stylus. The main feature of this work different from the previous work is to investigate if the user's complex task of sketching clustered graphs "nicely" can be alleviated by providing the cluster partition information. Results show that most participants can draw graphs with clear presence of bridge edges and clustering cohesiveness.
References
[1]
R. Brockenauer and S. Cornelsen. Drawing clusters and hierarchies. In M. Kaufmann and D. Wagner, editors, Drawing Graphs, volume 2025 of Lecture Notes in Computer Science, pages 193--227, 2001.
[2]
W. Didimo and F. Montecchiani. Fast layout computation of clustered networks: Algorithmic advances and experimental analysis. Information Sciences, 260(1):185--199, 2014.
[3]
P. Eades. A heuristic for graph drawing. Congress Numerantium, 42:149--160, 1994.
[4]
W. Huang, P. Eades, S.-H. Hong, and C.-C. Lin. Improving multiple aesthetics produces better graph drawings. Journal of Visual Language and Computing, 24(4):262--272, 2013.
[5]
W. Huang, M. Huang, and C.-C. Lin. Aesthetic of angular resolution for node-link diagrams: Validation and algorithm. In Proc. of 27th IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC 2011), pages 213--216. IEEE Press, 2011.
[6]
C.-C. Lin, Y.-Y. Lee, and H.-C. Yen. Mental map preserving graph drawing using simulated annealing. Information Sciences, 191(19):4253--4272, 2011.
[7]
H. Purchase. Which aesthetic has the greatest effect on human understanding? In Proc. of Graph Drawing 1997, volume 1027 of Lecture Notes in Computer Science, pages 248--261, 1997.
[8]
H. Purchase. Performance of layout algorithms: comprehension, not computation. Journal of Visual Language and Computing, 9(6):647--657, 1998.
[9]
H. Purchase, R. Cohen, and M. James. An experimental study of the basis for graph drawing algorithms. Journal of Experimental Algorithmics, 2, 1997. Article No. 4.
[10]
H. Purchase, C. Pilcher, and B. Plimmer. Graph drawing aesthetics--created by users, not algorithms. IEEE Transactions on Visualization and Computer Graphics, 18(1):81--92, 2012.
[11]
H. Purchase, B. Plimmer, R. Baker, and C. Pilcher. Graph drawing aesthetics in user-sketched graph layouts. In Proc. of 11th Australasian User Interface Conference, volume 106 of CPRIT, pages 80--88, 2010.
- On Clustered Graph Layouts Sketched by Users Based on Predefined Clusters
Recommendations
On aesthetics for user-sketched layouts of vertex-weighted graphs
AbstractRecent empirical works on graph drawing have investigated visual properties of graph drawings created by users based on adjacency lists of graphs as well as drawing behaviors. This is mainly done by asking participants to sketch these graphs on a ...
Cluster graph modification problems
In a clustering problem one has to partition a set of elements into homogeneous and well-separated subsets. From a graph theoretic point of view, a cluster graph is a vertex-disjoint union of cliques. The clustering problem is the task of making the ...
Evaluating esthetics for user-sketched layouts of clustered graphs with known clustering information
This paper aims to empirically analyze the esthetics for user-sketched layouts of clustered graphs with known clustering information. In our experiments, given not only the adjacency list of a clustered graph but also its predefined clustering ...
Comments
Information & Contributors
Information
Published In
August 2015
185 pages
ISBN:9781450334822
DOI:10.1145/2801040
- General Chair:
- Takayuki Itoh,
- Program Chairs:
- Paolo Bottoni,
- Shigeo Takahashi
Copyright © 2015 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 24 August 2015
Check for updates
Author Tags
Qualifiers
- Short-paper
- Research
- Refereed limited
Conference
VINCI '15
VINCI '15: The 8th International Symposium on Visual Information Communication and Interaction
August 24 - 26, 2015
AA, Tokyo, Japan
Acceptance Rates
VINCI '15 Paper Acceptance Rate 12 of 32 submissions, 38%;
Overall Acceptance Rate 71 of 193 submissions, 37%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 58Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in