An experimental study of the basis for graph drawing algorithms

  title={An experimental study of the basis for graph drawing algorithms},
  author={Helen C. Purchase and Robert F. Cohen and Murray I. James},
  journal={ACM J. Exp. Algorithmics},
Designers of graph drawing algorithms and systems claim to illuminate application data by producing layouts that optimise measurable aesthetic qualities. Examples of these aesthetics include symmetry (where possible, a symmetrical view of the graph should be displayed), minimise arc crossing(the number of arc crossings in the display should be minimised), and minimise bends (the total number of bends in polyline arcs should be minimised). The aim of this paper is to describe our work to… Expand
Experimental studies on graph drawing algorithms
The results of some of the most popular experimental studies on graph drawing algorithms are described, each of which presents an in‐depth comparative analysis on a specific class of algorithms, namely, algorithms for orthogonal drawings, interactive algorithms, algorithm for hierarchical drawings, and force‐directed and randomized algorithms. Expand
Performance of Layout Algorithms: Comprehension, not Computation
There is no statistical difference between the performance data of the algorithms when applied to this graph, indicating that they produce drawings of comparable difficulty, despite the different aesthetic bases for the algorithms. Expand
Analysis of Various Graph Layout Approaches Used in GUESS Software
One challenge in node-link diagrams is how to efficiently provide a node placement or layout that will yield a meaningful graph visualization. For simple structures, the system needs only a set ofExpand
Trade-Off Between Mental Map and Aesthetic Criteria in Simulated Annealing Based Graph Layout Algorithms
This work used Simulated Annealing algorithms to calculate layouts which fulfill aesthetic and Mental Map requirements simultaneously, and shows that even without explicitly optimizing Mental Map criteria, recognition can be supported by simply using the previous layout as a starting point, rather than a new layout with randomly allocated vertices. Expand
Measuring Symmetry in Drawings of Graphs
This paper evaluates two algorithms that have been proposed for measuring graph drawing symmetry, comparing their judgments to those of human subjects, and investigating the use of stress as an alternative measure of symmetry. Expand
Area-efficient grid drawings of graphs
The visualization of relational information is concerned with the presentation many applications in diverse domains such as software engineering, biology, civil engineering, and cartography.Expand
Evaluating Graph Drawing Aesthetics: Defining and Exploring a New Empirical Research Area
This chapter describes a long-term project to investigate the validity of t he design principles on which many automatic graph layout algorithms are based, not from the perspective of computationalExpand
Dynamic multilevel graph layout and visualisation
An efficient method for approximating the n-body calculations used in Force Directed Placement is described, exploiting use of a multilevel scheme to approximate distance between groups of vertices much like the Barnes Hut Octree. Expand
Measuring Symmetry in Drawings of Graphs Submission
Layout symmetry is one of the important and desired features in drawing graphs. While there is a substantial body of work in computer vision around the detection and measurement of symmetry inExpand
Which Aesthetic has the Greatest Effect on Human Understanding?
In the creation of graph drawing algorithms and systems, designers claim that by producing layouts that optimise certain aesthetic qualities, the graphs are easier to understand. Such aestheticsExpand


On Embedding a Graph in the Grid with the Minimum Number of Bends
  • R. Tamassia
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1987
An algorithm is presented that computes a region preserving grid embedding with the minimum number of bends in edges with use of network flow techniques, and runs in time $O(n^2 \log n)$, where n is the number of vertices of the graph. Expand
Drawing graphs in the plane with high resolution
This paper presents the problem of drawing a graph in the plane so that edges appear as straight lines and the minimum angle formed by any pair of incident edges is maximized. The resolution of aExpand
A Framework for the Automated Drawing of Data Structure Diagrams
The internal architecture of a (sub)system that helps draw data structure diagrams is outlined and the rules used have not reached a level of acceptance comparable to that of the relevant rules in engineering graphics. Expand
A method for drawing graphs
The authors are developing programs that draw pictures of graphs in the plane, and there are au infinite number of pictures that represent a given graph. Expand
Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)
The first nontrivial upper bound on the angular resolution of planar straight-line drawings is proved, and a continuous trade-off between the area and theangular resolution is shown. Expand
Visualizing object oriented software in three dimensions
This paper presents a brief overview of the project, the software architecture and some preliminary empirical results, and the strategy is to combine partially automatic layout with manual layout. Expand
A classification of visual representations
The cognitive structure of graphics is examined and a structural classification of visual representations of graphs and images is reported to report, if visualization is to continue to advance as an interdisciplinary science, it must become more than a grab bag of techniques for displaying data. Expand
Geometry of planar graphs with angles
Some necessary conditions for the planarity of general angle-graphs are described, and necessary and sufficient conditions for some special classes of angle- graphs are given. Expand
Nonparametric Statistics for the Behavioral Sciences.
This is the revision of the classic text in the field, adding two new chapters and thoroughly updating all others. The original structure is retained, and the book continues to serve as a combinedExpand
Drag: a graph drawing system