Performance of layout algorithms: Comprehension, not computation

Journal of Visual Languages and Computing

Volumn 9, Issue 6, 1998, Pages 647-657

  Purchase, Helen C ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032335892     PISSN: 1045926X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jvlc.1998.0093     Document Type: Article

References (23)

1. 1. G. Di Battista, P. Eades, R. Tamassia & I. Tollis (1994) Algorithms for drawing graphs: an annotated bibliography. Computational Geometry. Theory and Applications 4.
2. 2. R. Tamassia, G. Di Battista & C. Batini (1988) Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man and Cybernetics SMC-18, 61-79.
3. 3. F. Brandenburg, M. Himsolt & C. Rohrer (1995) An experimental comparison of force-directed and randomised graph drawing algorithms. In: Proceedings of Graph Drawing Symposium, 1995. F. Brandenburg, ed., Lecture Notes in Computer Science, Vol. 1027, Springer, Passau.
4. 4. M. Himsolt (1995) Comparing and evaluating layout algorithms within GRAPHED. Journal of Visual Languages and Computing 6.
5. 5. J. Blyth, C. McGrath & D. Krackhardt (1995) The effect of graph layout on inference from social network data. In: Proceedings of Graph Drawing Symposium, 1995. F. Brandenburg, ed., Lecture Notes in Computer Science, Vol. 1027, Springer, Passau.
6. 6. C. Batini, M. Talamo & R. Tamassia (1984) Computer aided layout of entity-relationship diagrams. Journal of Systems and Software 4, 163-173.
7. 7. G. Booch (1990) Object-Oriented Design. Benjamin-Cummings, Menlo Park, CA.
8. 8. H. C. Purchase (1997) Which aesthetic has the greatest effect on human understanding? In: Proceedings of Graph Drawing Symposium, 1997. G. Di Battista, ed.), Lecture Notes in Computer Science, Vol. 1353, Springer, Rome, Italy.
9. 9. H. C. Purchase, R. F. Cohen & M. James. An experimental study of the basis for graph drawing algorithms. ACM Journal of Experimental Algorithmics 2.
10. 10. R. Gottsdanker (1978) Experimenting in Psychology. Prentice-Hall, Englewood Cliffs, NJ.
11. 11. M. Himsolt (1990) GRAPHED user manual. Universität Passau.
12. 12. M. Himsolt (1997) Personal communication.
13. 13. T. Fruchterman & E. Reingold (1991) Graph drawing by force-directed placement. Software-Practice and Experience 21, 1129-1164.
14. 14. P. Eades (1984) A heuristic for graph drawing. Congressus Numeratum 42, 149-160.
15. 15. T. Kamada & S. Kawai (1989) An algorithm for drawing general undirected graphs. Information Processing Letters 31, 7-15.
16. 16. R. Tamassia (1987) On embedding a graph in the grid with the minimum number of bends. SIAM Journal of Computing 16, 421-444.
17. 17. D. Woods (1982) Drawing planar graphs. PhD. thesis, Department of Computer Science, Stanford University, 1982. Technical Report STAN-CS-82-943.
18. 18. H. de Fraysseix, J. Pach & R. Pollack (1990) How to draw a planar graph on a grid. Combinatorica 10, 41-51.
19. 19. M. Chrobak & T. H. Payne (1990) A linear time algorithm for drawing a planar graph on a grid. Technical Report UCR-CS-90-2, Dept. of Math. and Comput. Sci., Univ. California Riverside.
20. 20. K. Seisenberger (1991) Termgraph: Ein system zur zeichnerischen darstellung von strukturierten agenten und petrinetzen. Technical Report, University of Passau.
21. 21. D. Tunkelang (1992) A practical approach to drawing undirected graphs. Technical Report CMU-CS-94-161, Carnegie Mellon School of Computer Science.
22. 22. P. R. Hinton (1995) Statistics Explained. Routledge, London.
23. 23. H. C. Purchase & D. Leonard (1996) Graph drawing aesthetic metrics. Technical Report 361, University of Queensland Department of Computer Science.