Abstract
Symmetry is one of the most important aesthetic criteria which clearly reveals the structure of the graph. However, previous work on symmetric graph drawing has focused on two dimensions. In this paper, we extend symmetric graph drawing into three dimensions. Symmetry in three dimensions is much richer than that of two dimensions. We present a linear time algorithm for finding maximum number of three dimensional symmetries in series parallel digraphs.
This research has been supported by a Postdoctoral Fellowship from the Korean Science and Engineering Foundation and a grant from the Australian Research Council. Animated drawings are available from S. Hong;
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Aho, J. Hopcroft and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
P. Bertolazzi, R. F. Cohen, G. D. Battista, R. Tamassia and I. G. Tollis, How to Draw a Series Parallel Digraph, International Journal of Computational Geometry and Applications, 4 (4), pp 385–402, 1994.
H. Carr and W. Kocay, An Algorithm for Drawing a Graph Symmetrically, Bulletin of the ICA, Vol. 27, pp. 19–25, 1999.
R. F. Cohen, G. D. Battista, R. Tamassia and I. G. Tollis, Dynamic Graph Drawing:Trees, Series Parallel Digraphs, and Planar st-Digraphs, SIAM Journal on Computing, 24 (5), pp 970–1001, 1995.
P. Eades and X. Lin, Spring Algorithms and Symmetry, Computing and Combinatorics, Springer Lecture Notes in Computer Science 1276, (Ed. Jiang and Lee), pp. 202–211.
H. 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.
S. Hong, P. Eades, A. Quigley and S. Lee, Drawing Algorithms for Series Parallel Digraphs in Two and Three Dimensions, In S. Whitesides, editor, Graph Drawing (Proc. GD’98), vol. 1547 of Lecture Notes in Computer Science, pp. 198–209, Springer Verlag, 1998.
S. Hong, P. Eades and S. Lee, An Algorithm for Finding Geometric Automorphisms in Planar Graphs, Algorithms and Computation, (Proc. of ISAAC98), 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, to appear Graph Drawing (Proc. GD’2000), Lecture Notes in Computer Science, Springer Verlag, 2000.
X. Lin, Analysis of Algorithms for Drawing Graphs, Ph.D. Thesis, University of Queensland, 1992.
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 Outer-planar 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.
J. Valdes, R. Tarjan and E. Lawler, The Recognition of Series Parallel Digraphs, SIAM Journal on Computing 11(2), pp. 298–313, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hong, SH., Eades, P. (2000). An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, SH. (eds) Algorithms and Computation. ISAAC 2000. Lecture Notes in Computer Science, vol 1969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40996-3_23
Download citation
DOI: https://doi.org/10.1007/3-540-40996-3_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41255-7
Online ISBN: 978-3-540-40996-0
eBook Packages: Springer Book Archive