User Preference of Graph Layout Aesthetics: A UML Study
Purchase on Springer.com
$29.95 / €24.95 / £19.95*
* Final gross prices may vary according to local VAT.
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimising the number of crossings, maximising symmetry). Experiments investigating the worth of such algorithms from the point of view of human usability can take a number of different forms, depending on whether the graph has meaning in the real world, the nature of the usability measurement, and the effect being investigated (algorithms or aesthetics). Previous studies have investigated performance on abstract graphs with respect to both aesthetics and algorithms, finding support for reducing the number of crossings and bends, and increasing the display of symmetry.
This paper reports on preference experiments assessing the effect of individual aesthetics in the application domain of UML diagrams, resulting in a priority listing of aesthetics for this domain. The results reveal a difference in aesthetic priority from those of previous domain-independent experiments.
- G. Booch, J. Rumbaugh, and I. Jacobson. The Unified Modeling Language User Guide. Addison-Wesley, 1998.
- M.K. Coleman and D. Stott Parker. Aesthetics-based graph layout for human consumption. Software-Practice and Experience, 26(12):1415–1438, 1996. CrossRef
- P. Eades and K. Sugiyama. How to draw a directed graph. Journal of Information Processing, 13(4):424–437, 1990.
- A. Papakostas and I.G. Tollis. Efficient orthogonal drawings of high degree graphs. Algorithmica, 26(1):100–125, 2000. CrossRef
- 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 e_ect 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. CrossRef
- E. Reingold and J. Tilford. Tidier drawing of trees. IEEE Transactions on Software Engineering, SE-7(2):223–228, 1981. CrossRef
- R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Computing, 16(3): 421–444, 1987. CrossRef
- User Preference of Graph Layout Aesthetics: A UML Study
- Book Title
- Graph Drawing
- Book Subtitle
- 8th International Symposium, GD 2000 Colonial Williamsburg, VA, USA, September 20–23, 2000 Proceedings
- pp 5-18
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.