Abstract
In this paper we have introduced two algorithms for drawing series parallel digraphs. One constructs two dimensional drawings which display symmetries, the other constructs three dimensional drawings with a footprint of minimum size.
Future work will include combinations of these two algorithms: we would like to display as much symmetry as possible in a three dimensional drawing of small footprint.
This is an extended abstract. This research has been supported by an Australian Research Council Grant, KOSEF No.971-0907-045-1, and the SCARE project at the University of Limerick. Note that the three dimensional drawings in this paper are static. Animated drawings are available from A. Quigley. http://www.cs.newcastle.edu.au/~aquigley.. This paper was partially written when the first author was visiting the University of Newcastle.
Chapter 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.
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), 202–211.
P. Eades, T. Lin and X. Lin, Minimum Size h-v Drawings, Advanced Visual Interfaces (Proceedings of AVI 92, Rome, July 1992), World Scientific Series in Computer Science 36, pp. 386–394.
X. Lin, Analysis of Algorithms for Drawing Graphs, PhD thesis,University of Queensland 1992.
A. Lubiw, Some NP-Complete Problems similar to Graph Isomorphism, SIAM Journal on Computing 10(1):11–21, 1981.
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, PhD Thesis, Purdue University 1990.
R.A. Mathon, A Note on Graph Isomorphism Counting Problem, Information Processing Letters 8, 1979, pp. 131–132.
R. Tamassia and I. G. Tollis, A unified approach to visibility representations of planar graphs, Discr. and Comp. Geometry 1 (1986), pp. 321–341.
J. Valdes, R. Tarjan and E. Lawler, The Recognition of Series-Parallel Digraphs, SIAM Journal on Computing 11(2), pp. 298–313, 1982.
J. Valdes, Parsing Flowchart and Series-Parallel Graphs, Technical Report STAN-CS-78-682, Computer Science Department, Stanford University, 1978.
H. Wielandt, Finite permutation groups, Academic Press, 1964.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hong, SH., Eades, P., Quigley, A., Lee, SH. (1998). Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions. In: Whitesides, S.H. (eds) Graph Drawing. GD 1998. Lecture Notes in Computer Science, vol 1547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37623-2_15
Download citation
DOI: https://doi.org/10.1007/3-540-37623-2_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65473-5
Online ISBN: 978-3-540-37623-1
eBook Packages: Springer Book Archive