An experimental study of the basis for graph drawing algorithms
- 1 January 1997
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Journal of Experimental Algorithmics
Abstract
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 validate these claims by performing empirical studies of human understanding of graphs drawn using various layout aesthetics. This work is important since it helps indicate to algorithm and system designers what are the aesthetic qualities most important to aid understanding, and consequently to build more effective systems.Keywords
This publication has 6 references indexed in Scilit:
- A classification of visual representationsCommunications of the ACM, 1994
- Drawing Graphs in the Plane with High ResolutionSIAM Journal on Computing, 1993
- A framework for the automated drawing of data structure diagramsIEEE Transactions on Software Engineering, 1990
- On Embedding a Graph in the Grid with the Minimum Number of BendsSIAM Journal on Computing, 1987
- Geometry of planar graphs with anglesPublished by Association for Computing Machinery (ACM) ,1986
- A method for drawing graphsPublished by Association for Computing Machinery (ACM) ,1985