Abstract
In this paper, we investigate symmetric graph drawing in three dimensions. We show that the problem of drawing a graph with a maximum number of symmetries in three dimensions is NP-hard. Then we present a polynomial time algorithm for finding maximum number of three dimensional symmetries in planar graphs.
In this extended abstract, many proofs are omitted. This research has been supported by a grant from the Australian Research Council. Three dimensional drawings are available from http://www.cs.usyd.edu.au/shhong/research7.htm.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
L. Babai, Automorphism Groups, Isomorphism, and Reconstruction, Chapter 27 of Handbook of Combinatorics, Volume 2, (Ed. Graham, Groetschel and Lovasz), Elsevier Science, 1995.
S. Bachl, Isomorphic Subgraphs, Graph Drawing, Lecture Notes in Computer Science 1731, (Ed. J. Kratochvil), pp. 286–296, Springer Verlag, 1999.
G. Di Battista and R. Tamassia, On-Line Maintenance of Triconnected Components with SPQR-Trees, Algorithmica 15, pp. 302–318, 1996.
H. Chen, H. Lu and H. Yen, On Maximum Symmetric Subgraphs, Graph Drawing, Lecture Notes in Computer Science 1984, (Ed. J. Marks), pp. 372–383, Springer Verlag, 2001.
P. Eades and X. Lin, Spring Algorithms and Symmetry, Theoretical Computer Science, Vol. 240 No.2, pp. 379–405, 2000.
H. Fraysseix, An Heuristic for Graph Symmetry Detection, Graph Drawing, Lecture Notes in Computer Science 1731, (Ed. J. Kratochvil), pp. 276–285, Springer Verlag, 1999.
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.
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.
S. Hong and P. Eades, An Algorithms for Finding Three Dimensional Symmetry in Trees, Graph Drawing, Lecture Notes in Computer Science 1984, (Ed. J. Marks), pp. 360–371, Springer Verlag, 2001.
S. Hong and P. Eades, An Algorithms for Finding Three Dimensional Symmetry in Series Parallel Digraphs, Algorithms and Computation, Lecture Notes in Computer Science 1969, (Ed. D. T. Lee and S. Teng), pp. 266–277, Springer Verlag, 2000.
J. E. Hopcroft and R. E. Tarjan, Isomorphism of Planar Graphs, Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds., Plenum Press, New York, pp. 131–151, 1972.
J. E. Hopcroft and J. K. Wong, Linear Time Algorithm for Isomorphism of Planar Graphs, Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 172–184, 1974.
R. J. Lipton, S. C. North and J. S. Sandberg, A Method for Drawing Graphs, In Proc. ACM Symposium on Computational Geometry, pp. 153–160, ACM, 1985.
A. Lubiw, Some NP-Complete Problems similar to Graph Isomorphism, SIAM Journal on Computing 10(1), pp. 11–21, 1981.
P. Mani, Automorphismen von Polyedrischen Graphen, Math. Annalen, 192, pp. 279–303, 1971.
J. Manning and M. J. Atallah, Fast Detection and Display of Symmetry in Trees, Congressus Numerantium 64, pp. 159–169, 1988.
J. Manning and M. J. Atallah, Fast Detection and Display of Symmetry in Outerplanar Graphs, Discrete Applied Mathematics 39, pp. 13–35, 1992.
J. Manning, Geometric Symmetry in Graphs, Ph.D. Thesis, Purdue Univ., 1990.
G. E. Martin, Transformation Geometry, an Introduction to Symmetry, Springer, New York, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hong, SH. (2002). Drawing Graphs Symmetrically in Three Dimensions. In: Mutzel, P., Jünger, M., Leipert, S. (eds) Graph Drawing. GD 2001. Lecture Notes in Computer Science, vol 2265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45848-4_16
Download citation
DOI: https://doi.org/10.1007/3-540-45848-4_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43309-5
Online ISBN: 978-3-540-45848-7
eBook Packages: Springer Book Archive