User Preference of Graph Layout Aesthetics: A UML Study

Purchase, Helen C. and Allder, Jo-Anne and Carrington, David (2001) User Preference of Graph Layout Aesthetics: A UML Study. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 5-18 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_2).

Full text not available from this repository.

Abstract

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.

Item Type:Conference Paper
Additional Information:10.1007/3-540-44541-2_2
Classifications:D Aesthetics > D.001 General
ID Code:280

Repository Staff Only: item control page

References

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 hu,am consumption. Software - Practice and Experience, 26(12):1415-1438, 1996.

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.

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.

E. Reingold and J. Tilford. Tidier drawing of trees. IEEE Transactions on Software Engineering, SE-7(2):223-228, 1981.

R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Computing, 16(3):421-444, 1987.