Graph layout aesthetics in UML diagrams: User preferences

Journal of Graph Algorithms and Applications

Volumn 6, Issue 3, 2002, Pages 255-279

  Purchase, Helen C ^a   Allder, Jo Anne ^a   Carrington, David ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

AESTHETIC CRITERIA; GRAPH LAYOUT; GRAPH LAYOUT ALGORITHMS; MINIMIZING THE NUMBER OF; ORTHOGONALITY; PERFORMANCE; REAL-WORLD; UML DIAGRAMS; USABILITY MEASUREMENTS; USER'S PREFERENCES;

COMPUTATIONAL EFFICIENCY;

EID: 3042769651     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00054     Document Type: Conference Paper

References (10)

1. G. Booch, J. Rumbaugh, and I. Jacobson. The Unified Modeling Language User Guide. Addison-Wesley, 1998.
2. M. Coleman and D. Stott Parker. Aesthetics-based graph layout for human consumption. Software - Practice and Experience, 26(12):1415-1438, 1996.
3. P. Eades and K. Sugiyama. How to draw a directed graph. Journal of Information Processing, 13(4):424-437, 1990.
4. P. Irani and C. Ware. Diagrams based on structural object perception. In Proceedings of the Conference on Advanced Visual Interfaces, Palermo, Italy, pages 61-67, 2000.
5. A. Papakostas and I. Tollis. Efficient orthogonal drawings of high degree graphs. Algorithmica, 26(1):100-125, 2000.
6. M. Petre. Why looking isn't always seeing: Readership skills and graphical programming. CACM, 38(6):33-44, June 1995.
7. 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.
8. H. C. Purchase. Performance of layout algorithms: Comprehension, not computation. Journal of Visual Languages and Computing, 9:647-657, 1998.
9. E. Reingold and J. Tilford. Tidier drawing of trees. IEEE Transactions on Software Engineering, SE-7(2):223-228, 1981.
10. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Computing, 16(3):421-444, 1987.