Symmetric drawings of triconnected planar graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 356-365

  Hong, Seok Hee ^a   McKay, Brendan ^b   Eades, Peter ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); GRAPH THEORY; GRAPHIC METHODS;

AESTHETIC CRITERIA; AUTOMORPHISMS; GRAPH DRAWING; LINEAR TIME; QUADRATIC TIME; STRAIGHT-LINE DRAWINGS; SYMMETRIC DRAWINGS; TRICONNECTED PLANAR GRAPHS;

ALGORITHMS;

EID: 84968911248     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. M. A. Armstrong, Groups and Symmetry, Springer-Verlag, 1988.
2. L. Babai, Automorphism Groups, Isomorphism, and Reconstruction, Chapter 27 of Handbook of Combinatorics Volume 2 (ed. Graham, Groetschel and Lovasz), Elsevier Science 1995.
3. M. Bern and D. Eppstein, Optimal Möbius Transformations for Information Visualization and Meshing, WADS 2001, Lecture Notes in Computer Science 2125, (Ed. F. Dehne, J. R. Sack, R. Tamassia), pp. 14-25, Springer Verlag, 2001.
4. G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall 1998.
5. N. Chiba, T. Yamanouchi and T. Nishizeki, Linear Algorithms for Convex Drawings of Planar Graphs, Progress in Graph Theory, Academic Press, pp. 153-173, 1984.
6. P. Eades and X. Lin, Spring Algorithms and Symmetry, Theoretical Computer Science, Vol. 240 No-2, pp. 379-405, 2000.
7. M. Fontet, Linear Algorithms for Testing Isomorphism of Planar Graphs, Proceedings Third Colloquium on Automata, Languages, and Programming, pp. 411-423, 1976.
8. H. de Fraysseix, An Heuristic for Graph Symmetry Detection, Graph Drawing '99, Lecture Notes in Computer Science 1731, (Ed. J. Kratochvil), pp. 276-285, Springer Verlag, 1999.
9. S. Hong, P. Eades and S. Lee, Drawing Series Parallel Digraphs Symmetrically, Computational Geometry: Theory and Applicatons Vol. 17, Issue 3-4, pp. 165-188, 2000.
10. S. Hong, P. Eades and S. Lee, An Algorithm for Finding Geometric Automorphisms in Planar Graphs, Algorithms and Computation, Lecture Notes in Computer Science 1533, (Ed. Chwa and Ibarra), pp. 277-286, Springer Verlag, 1998.
11. S. Hong, Drawing Graphs Symmetrically in Three Dimensions, Graph Drawing'01, Lecture Notes in Computer Science, Springer Verlag, To appear.
12. S. Hong and P. Eades, Drawing Biconnected Planar Graphs Symmetrically, Technical Report CS-IVG-2001-01, Basser Department of Computer Science, The University of Sydney, 2001.
13. X. Lin, Analysis oj Algorithms for Drawing Graphs, Ph.D. Thesis, University of Queensland, 1992.
14. A. Lubiw, Some NP-Complete Problems Similar to Graph Isomorphism, SIAM Journal on Computing 10(1) pp. 11-21, 1981.
15. P. Mani, Automorphismen von polyedrischen Graphen, Math. Annalen, 192, pp. 279-303, 1971.
16. J. Manning and M. J. Atallah, Fast Detection and Display of Symmetry in Trees, Congressus Numerantium, 64, pp. 159-169, 1988.
17. J. Manning and M. J. Atallah, Fast Detection and Display of Symmetry in Outerplanar Graphs, Discrete Applied Mathematics, 39, pp. 13-35, 1992.
18. J. Manning, Geometric Symmetry in Graphs, Ph.D. Thesis, Purdue Univ., 1990.
19. H. Purchase, Which aesthetic has the greatest effect on human understanding?, Graph Drawing 97, Lecture Notes in Computer Science 1353, (Ed. Di. Battista), pp. 248-259, Springer Verlag, 1998.
20. C. Thomassen, Planarity and duality of finite and infinite graphs, J. of Combinatorial Theory, Series B 29, pp. 244-271, 1980.
21. W. T. Tutte, How to Draw a Graph, Proc. London Math. Soc, 13, pp. 743-768, 1963.