Abstract
We use basic results from graph theory to design two algorithms for constructing 3-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. Our first algorithm gives drawings bounded by an O(√n× O(√n) × O(√n) box; each edge route contains at most 7 bends. The best previous result generated edge routes containing up to 16 bends per route. Our second algorithm gives drawings having at most 3 bends per edge route. The drawings lie in an O(n)×O(n) × O(n) bounding box. Together, the two algorithms initiate the study of bend/bounding box trade-off issues for 3-dimensional grid drawings.
supported by ARC
supported by an ARC Institutional grant
supported by FCAR and NSERC
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
C. Berge, Graphs and Hypergraphs, North Holland, Amsterdam, 1973.
S. Bhatt, S. Cosmadakis, “The Complexity of Minimizing Wire Lengths in VLSI Layouts”, Information Processing Letters, Vol. 25, 1987, pp. 263–267.
T. Biedl, Embedding Nonplanar Graphs in the Rectangular Grid, Rutcor Research Report 27-93, 1993.
T. Biedl and G. Kant, “A Better Heuristic for Orthogonal Graph Drawings”, Proc. 2 nd European Symposium on Algorithms (ESA '94), Lecture Notes in Computer Science, Vol. 855, Springer Verlag, 1994, pp. 24–35.
T. Biedl, “New Lower Bounds for Orthogonal Graph Drawings”, Graph Drawing, Lecture Notes in Computer Science, Vol. 1027, Springer Verlag, 1995, pp. 28–39.
J. A. Bondy, U. S. R. Murty, Graph Theory with Applications, North Holland, Amsterdam, 1976.
G. DiBattista, P. Eades, R. Tamassia, I. Tollis, “Algorithms for Drawing Graphs: An Annotated Bibliography”, Computational Geometry: Theory and Applications, Vol. 4, 1994, pp. 235–282.
D. Dolev, F. T. Leighton, H. Trickey, “Planar Embeddings of Planar Graphs”, Advances in Computing Research 2 (ed. F. P. Preparata), JAI Press Inc., Greenwich CT, USA, 1984, pp. 147–161.
P. Eades, C. Stirk, S. Whitesides, The Techniques of Komolgorov and Bardzin for Three Dimensional Orthogonal Graph Drawings, TR 95-07, Dept. of Computer Science, University of Newcastle NSW, Australia, October 1995.
Shimon Even, Graph Algorithms, Computer Science Press, 1979.
S. Even and G. Granot, “Rectilinear Planar Drawings with Few Bends in Each Edge”, Technical Report 797, Computer Science Department, Technion, 1994.
A. Garg, R. Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing, TR CS-94-10, Dept. of Computer Science, Brown University, 1994.
P. Hall, “On Representation of Subsets”, J. London Mathematical Society, Vol. 10, 1935, pp. 26–30.
J. E. Hopcroft, R. M. Karp, “An n 5/2 Algorithm for Maximum Matchings in Bipartite Graphs”, SIAM J. Comput., Vol. 2 (4), 1973, pp. 225–231.
Goos Kant, “Drawing Planar Graphs Using the lmc-Ordering”, Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992, pp. 101–110.
A. N. Komolgorov, Ya. M. Bardzin, “About Realisation of Sets in in 3-Dimensional Space”, Problems in Cybernetics, March 1967, pp. 261–268.
A. Papakostas and I. Tollis, “A Pairing Technique for Area-Efficient Orthogonal Drawings”, these proceedings.
F. P. Preparata, “Optimal Three-Dimensional VLSI Layouts”, Mathematical Systems Theory, Vol. 16, 1983, pp.1–8.
A. L. Rosenberg, “Three-Dimensional Integrated Circuitry”, Advanced Research in VLSI (eds. Kung, Sproule, Steele), 1981, pp. 69–80.
A. L. Rosenberg, “Three-Dimensional VLSI: A Case Study”, Journal of the ACM, Vol. 30 (3), 1983, pp. 397–416.
Markus Schäffter, “Drawing Graphs on Rectangular Grids”, Discrete Applied Math. Vol. 63, 1995, pp. 75–89.
R. Tamassia, “On Embedding a Graph in the Grid with a Minimum Number of Bends”, SIAM J. Comput., Vol. 16 (3), 1987, pp. 421–443.
R. Tamassia and I. Tollis, “A Unified Approach to Visibility Representations of Planar Graphs”, Discrete and Computational Geometry, Vol. 1, 1986, pp. 321–341.
R. Tamassia and I. Tollis, “Efficient Embeddings of Planar Graphs in Linear Time”, IEEE Symposium on Circuits and Systems, 1987, pp. 495–498.
R. Tamassia and I. Tollis, “Planar Grid Embedding in Linear Time”, IEEE Transactions on Circuits and Systems, Vol. 36 (9), 1989, pp. 1230–1234.
David Wood, “On Higher-Dimensional Orthogonal Graph Drawing”, manuscript, 1996, Dept. of Computer Science, Monash U.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eades, P., Symvonis, A., Whitesides, S. (1997). Two algorithms for three dimensional orthogonal graph drawing. In: North, S. (eds) Graph Drawing. GD 1996. Lecture Notes in Computer Science, vol 1190. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62495-3_44
Download citation
DOI: https://doi.org/10.1007/3-540-62495-3_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62495-0
Online ISBN: 978-3-540-68048-2
eBook Packages: Springer Book Archive