Graph drawing by force-directed placement
Software—Practice & Experience
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
An experimental comparison of four graph drawing algorithms
Computational Geometry: Theory and Applications
Drawing graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Empirical Evaluation of Aesthetics-based Graph Layout
Empirical Software Engineering
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms
GD '95 Proceedings of the Symposium on Graph Drawing
Validating Graph Drawing Aesthetics
GD '95 Proceedings of the Symposium on Graph Drawing
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
User Preference of Graph Layout Aesthetics: A UML Study
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Nice class diagrams admit good design?
Proceedings of the 2003 ACM symposium on Software visualization
Cognitive measurements of graph aesthetics
Information Visualization
Motion to support rapid interactive queries on node--link diagrams
ACM Transactions on Applied Perception (TAP)
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Visualizing graphs in three dimensions
ACM Transactions on Applied Perception (TAP)
Perceptual Organization in User-Generated Graph Layouts
IEEE Transactions on Visualization and Computer Graphics
An Experimental Study on Distance-Based Graph Drawing
Graph Drawing
A Comparison of User-Generated and Automatic Graph Layouts
IEEE Transactions on Visualization and Computer Graphics
Node overlap removal in clustered directed acyclic graphs
Journal of Visual Languages and Computing
Integrating edge routing into force-directed layout
GD'06 Proceedings of the 14th international conference on Graph drawing
Measuring effectiveness of graph visualizations: a cognitive load perspective
Information Visualization
Exploring the relative importance of crossing number and crossing angle
Proceedings of the 3rd International Symposium on Visual Information Communication
Evaluating the quality of clustering algorithms using cluster path lengths
ICDM'10 Proceedings of the 10th industrial conference on Advances in data mining: applications and theoretical aspects
Discovering perceptions of personal social networks through diagrams
Diagrams'10 Proceedings of the 6th international conference on Diagrammatic representation and inference
Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics
VLHCC '10 Proceedings of the 2010 IEEE Symposium on Visual Languages and Human-Centric Computing
Animation, Small Multiples, and the Effect of Mental Map Preservation in Dynamic Graphs
IEEE Transactions on Visualization and Computer Graphics
Graph Drawing Aesthetics—Created by Users, Not Algorithms
IEEE Transactions on Visualization and Computer Graphics
An experimental comparison of fast algorithms for drawing general large graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Layout effects on sociogram perception
GD'05 Proceedings of the 13th international conference on Graph Drawing
Curvilinear graph drawing using the force-directed method
GD'04 Proceedings of the 12th international conference on Graph Drawing
Comparing the readability of graph layouts using eyetracking and task-oriented analysis
Computational Aesthetics'09 Proceedings of the Fifth Eurographics conference on Computational Aesthetics in Graphics, Visualization and Imaging
Hi-index | 0.00 |
Many automatic graph drawing algorithms implement only one or two aesthetic criteria since most aesthetics conflict with each other. Empirical research has shown that although those algorithms are based on different aesthetics, drawings produced by them have comparable effectiveness. The comparable effectiveness raises a question about the necessity of choosing one algorithm against another for drawing graphs when human performance is a main concern. In this paper, we argue that effectiveness can be improved when algorithms are designed by making compromises between aesthetics, rather than trying to satisfy one or two of them to the fullest. We therefore introduce a new algorithm: BIGANGLE. This algorithm produces drawings with multiple aesthetics being improved at the same time, compared to a classical spring algorithm. A user study comparing these two algorithms indicates that BIGANGLE induces a significantly better task performance and a lower cognitive load, therefore resulting in better graph drawings in terms of human cognitive efficiency. Our study indicates that aesthetics should not be considered separately. Improving multiple aesthetics at the same time, even to small extents, will have a better chance to make resultant drawings more effective. Although this finding is based on a study of algorithms, it also applies in general graph visualization and evaluation.