Abstract
An orthogonal drawing of a graph is a planar drawing such that all the edges are polygonal chains of horizontal and vertical segments. Finding the planar embedding of a planar graph such that its orthogonal drawing has the minimum number of bends is a fundamental open problem in graph drawing. This paper provides the first partial solution to the problem. It gives a new combinatorial characterization of orthogonal drawings based on the concept of spirality and provides a polynomial-time algorithm for series-parallel graphs and biconnected 3-planar graphs.
Work partially supported by Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo of the CNR and by Esprit BRA of the EC Under Contract 7141 Alcom II
Part of this work has been done when this author was visiting the Department of Computer Science of McGill University
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P. Bertolazzi, R.F. Cohen, G. Di Battista, R. Tamassia, and I.G. Tollis, “How to Draw a Series-Parallel Digraph,” Proc. 3rd Scandinavian Workshop on Algorithm Theory, 1992.
G. Di Battista and R. Tamassia “Algorithms for Plane Representations of Acyclic Digraphs,” Theoretical Computer Science, vol. 61, pp. 175–198, 1988.
G. Di Battista and R. Tamassia “Incremental Planarity Testing,” Proc. 30th IEEE Symp. on Foundations of Computer Sciene, pp. 436–441, 1989.
G. Di Battista and R. Tamassia “On Line Planarity Testing,” Technical Report CS-89-31, Dept. of Computer Science, Brown Univ. 1989.
P. Eades and R. Tamassia, “Algorithms for Automatic Graph Drawing: An Annotated Bibliography,” Technical Report CS-89-09, Dept. of Computer Science, Brown Univ. 1989.
S. Even “Graph Algoritms,” Computer Science Press, Potomac, MD, 1979.
G. Kant “A New Method for Planar Graph Drawings on a Grid,” Proc. IEEE Symp. on Foundations of Computer Science, 1992.
E. L. Lawler “Combinatorial Optimization: Networks and Matroids,” Holt, Rinehart and Winston, New York, Chapt. 4, 1976.
T. Nishizeki and N. Chiba, “Planar Graphs: Theory and Algorithms,” Annals of Discrete Mathematics 32, North-Holland, 1988.
J. A. Storer “On Minimal Node-Cost Planar Embeddings,” Networks, vol. 14, pp. 181–212, 1984.
R. Tamassia “On Embedding a Graph in the Grid with the Minimum Number of Bends,” SIAM J. Computing, vol. 16, no. 3, pp. 421–444, 1987.
R. Tamassia, “Planar Orthogonal Drawings of Graphs,” Proc. IEEE Int. Symp. on Circuits and Systems, 1990.
R. Tamassia and I.G. Tollis “Efficient Embedding of Planar Graphs in Linear Time,” Proc. IEEE Int. Symp. on Circuits and Systems, Philadelphia, pp. 495–498, 1987.
R. Tamassia and I.G. Tollis “Planar Grid Embedding in Linear Time,” IEEE Trans. on Circuits and Systems, vol. CAS-36, no. 9, pp. 1230–1234, 1989.
R. Tamassia, I. G. Tollis, and J. S. Vitter “Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings,” Proc. IEEE Symp. on Parallel and Distributed Processing, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Battista, G., Liotta, G., Vargiu, F. (1993). Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract). In: Dehne, F., Sack, JR., Santoro, N., Whitesides, S. (eds) Algorithms and Data Structures. WADS 1993. Lecture Notes in Computer Science, vol 709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57155-8_244
Download citation
DOI: https://doi.org/10.1007/3-540-57155-8_244
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57155-1
Online ISBN: 978-3-540-47918-5
eBook Packages: Springer Book Archive