Spring algorithms and symmetry

Theoretical Computer Science

Volumn 240, Issue 2, 2000, Pages 379-405

  Eades, Peter ^a   Lin, Xuemin ^b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347698481     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00239-X     Document Type: Article

References (26)

1. J.A. Bondy, U.S.R. Murty, Graph Theory with Application, Macmilan, New York, 1977.
2. B. Becker, G. Hotz, On the optimal layout of planar graphs with fixed boundary, SIAM J. Comput. 16(15) 1987.
3. R. Davidson, Harel, Drawing graphs nicely using simulated annealing, Tech. Rep. Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, 1989.
4. G. Di Battista, P. Eades, R. Tamassia, Algorithms for drawing graphs: an annotated bibliography, Comput. Geometry: Theory Appl. 4 (1994) 235-282.
5. G. Di Battista, R. Tammassia, I.G. Tollis, Area requirement and symmetry display of planar upward drawings, Discrete Comput. Geometry 7 (1992) 381-401.
6. P. Eades, A heuristic for graph drawing, Congr. Numer. 42 (1984) 149-160.
7. P. Eades, X. Lin, R. Tamassia, An algorithm for drawing a hierarchical graph, Internat. J. Comput. Geometry Appl. 6(2) (1996) 145-155.
8. T. Fruchterman, E. Reingold, Graph drawing by force-directed placement, Software-Practice Experience 21 (1991) 1129-1164.
9. I.N. Herstein, Topics in Algebra, Blaisdell Publishing Company, New York, 1964.
10. S.-H. Hong, P. Eades, S.-H. Lee, Finding planar geometric automorphisms in planar graphs, ISAAC 98: Algorithms and Computation, Lecture Notes in Computer Science, Vol. 1533, Springer, Berlin, 1998 pp. 277-286.
11. S.-H. Hong, P. Eades, A. Quigley, S.-H. Lee, Drawing algorithms for series-parallel digraphs in two and three dimensions, Graph Drawing 98, Lecture Notes in Computer Science Vol. 1547, Springer, Berlin, 1998, pp. 198-209.
12. T. Kamada, S. Kawai, Automatic display of network structures for human understanding, Inform. Process. Lett. 31 (1989) 7-15.
13. X. Lin, Analysis of algorithms for drawing graphs, Ph.D Thesis, University of Queensland, 1992.
14. R. Lipton, S. North, J. Sandberg, A method for drawing graphs, Proc. ACM Symp. on Computational Geometry, 1985, pp. 153-160.
15. J. Manning, Computational complexity of geometric symmetry detection in graphs, in: Proc. Great Lakes Computer Science Conference, Lecture Notes in Computer Science, Spring, Berlin, 1990.
16. J. Manning, M.J. Atallah, Fast detection and symmetry in trees, Congr. Numer. 64 (1988) 159-168.
17. J. Manning, M.J. Atallah, Fast detection and display of symmetry in outerplanar graphs, Technical Report CSD-TR-606, Dept. of Computeer Sciences, Purdue Univ., West Lafayette, IN, 1986.
18. G.E. Martin, Transformation Geometry - An Introduction to Symmetry, Springer, Berlin, 1982.
19. E.M. Reingold, J.S. Tilfold, Tidier drawings of trees, IEEE Trans. Software Eng. 7 (1981) 223-228.
20. F.W. Sears, M.W. Zemansky, University Physics, Addition-Wesley, 1963.
21. A.E. Taylor, Advanced Calculus, Ginn, Boston, 1955.
22. K. Sugiyama, K. Misue, Graph drawing by the magnetic spring model, J. Visual Languages Comput. 6 (3) (1995) 217-232.
23. W.T. Tutte, Convex representations of graphs, Proc. London Math. Soc. 10(3) (1960) 304-320.
24. W.T. Tutte, How to draw a graph, Proc. London Math. Soc. 13(3) (1963) 304-320.
25. D. Tunkelang, A practical approach to drawing undirected graphs, Technical Report, Canegie Mellon University, 1994.
26. H. Wielandt, Finite Permutation Groups, Academic Press Inc., New York, 1964.