The effects of graph layout

Proceedings - 1998 Australasian Computer Human Interaction Conference, OzCHI 1998

Volumn 1998-November, Issue , 1998, Pages 80-86

  Purchase, Helen C ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; DRAWING (GRAPHICS); INTERACTIVE COMPUTER SYSTEMS;

AESTHETIC CRITERIA; GRAPH DRAWING; GRAPH LAYOUT; GRAPH STRUCTURES; HUMAN PERFORMANCE; INFORMATION VISUALISATION; POTENTIAL USERS; SINGLE GRAPH;

HUMAN COMPUTER INTERACTION;

EID: 84995643507     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/OZCHI.1998.732199     Document Type: Conference Paper

References (22)

1. S. Bhanji, H. C. Purchase, R. Cohen, and M. James. Validating graph drawing aesthetics: A pilot study. Technical Report 336, University of Queensland Department of Computer Science, 1995.
2. F. Brandenburg, M. Himsolt, and C. Rohrer. An experimental comparison of force-directed and randomised graph drawing algorithms. In F. Brandenburg, editor, Proceedings of Graph Drawing Symposium 1995. Springer-Verlag, Passau, Germany, 1995. Lecture Notes in Computer Science, 1027.
3. M. Chrobak and T. Payne. A linear time algorithm for drawing a planar graph on a grid.TechnicalReportUCR-CS-90-2, Dept. ofMath. and Comput. Sci., Univ. California Riverside, 1990.
4. H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41-51, 1990.
5. P. Eades. A heuristic for graph drawing. CongressusNumeratum, 42:149-160, 1984.
6. T. Fruchterman and E. Reingold. Graph drawing by forcedirected placement. Software-Practice and Experience, 21(11):1129-1164, 1991.
7. R.Gottsdanker. Experimenting in Psychology.Prentice-Hall, 1978.
8. M. Himsolt. GRAPHED user manual. Universität Passau, 1990.
9. M. Himsolt. Comparing and evaluating layout algorithms within GRAPHED. Journal of Visual Languages and Computing, 6, 1995.
10. M. Himsolt. Personal Communication, July 1997.
11. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7-15, 1989.
12. R. Lipton, S. North, and J. Sandberg. A method for drawing graphs. In Proc. ACM Symp. on Computational Geometry, pages 153-160, 1985.
13. G. Lohse, K. Biolsi, N. Walker, and H. Rueter. A classification of visual representations. Communications of the ACM, 37(12):36-49, December 1994.
14. H. C. Purchase. Which aesthetic has the greatest effect on human understanding? In G.Di Battista, editor, Proceedings ofGraphDrawing Symposium 1997. Springer-Verlag,Rome, Italy, 1997. Lecture Notes in Computer Science, 1353.
15. H. C. Purchase. Performance of layout algorithms: Comprehension, not computation. Journal of Visual Languages and Computing, 1998. To appear.
16. H. C. Purchase and D. Leonard. Graph drawing aesthetic metrics. Technical Report 361, University of Queensland Department of Computer Science, 1996.
17. E. Reingold and J. Tilford. Tidier drawing of trees. IEEE Transactions on Software Engineering, SE-7(2):223-228, 1981.
18. K. Seisenberger. Termgraph: Ein systemzur zeichnerischen darstellung von strukturierten agenten und petrinetzen. Technical report, University of Passau, 1991. Diploma Thesis.
19. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAMJ. Computing, 16(3):421-444, 1987.
20. H. Trickey. Drag: A graph drawing system. In Proc. Int. Conf. on Electronic Publishing, pages 171-182. Cambridge University Press, 1988.
21. D. Tunkelang. A practical approach to drawing undirected graphs. Technical report, Carnegie Mellon School of Computer Science, 1992. Technical Report CMU-CS-94-161.
22. D.Woods. Drawing PlanarGraphs. PhD thesis,Department of Computer Science, Stanford University, 1982. Technical Report STAN-CS-82-943.