Abstract
Many automatic graph layout algorithms have been implemented to display relational data in a graphical (usually node-arc) manner. The success of these algorithms is typically measured by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimising the number of crossings, maximising symmetry). Little research has been performed on the usability aspects of such algorithms: do they produce graph drawings that make the embodied information easy to use and understand? Is the computational effort expended on conforming to the assumed aesthetic criteria justifiable with espect to better usability? This paper reports on usability studies to investigate automatic graph layout algorithms with respect to human use.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
G. Booch, J. Rumbaugh, and I. Jacobson. The Unified Modeling Language User Guide. Addison-Wesley, 1998.
M. Himsolt. GRAPHED user manual. Universität Passau, 1990.
M. Petre. Why looking isn’t always seeing: Readership skills and graphical programming. CACM, 38(6):33–44, June 1995.
H. C. Purchase. Which aesthetic has the greatest effect on human understanding? In G. Di Battista, editor, Proceedings of Graph Drawing Symposium 1997, pages 248–259. Springer-Verlag, Rome, Italy, 1997. LNCS, 1353.
H. C. Purchase. Performance of layout algorithms: Comprehension, not computation. Journal of Visual Languages and Computing, 9:647–657, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Purchase, H.C., Carrington, D., Allder, JA. (2000). Experimenting with Aesthetics-Based Graph Layout. In: Anderson, M., Cheng, P., Haarslev, V. (eds) Theory and Application of Diagrams. Diagrams 2000. Lecture Notes in Computer Science(), vol 1889. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44590-0_46
Download citation
DOI: https://doi.org/10.1007/3-540-44590-0_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67915-8
Online ISBN: 978-3-540-44590-6
eBook Packages: Springer Book Archive