Abstract
In this paper,we study drawings of outer-planar graphs in various models.We showthat O (n log n )area can be achieved for such drawings if edges are allowed to have bends or if vertices may be represented by boxes.The question of straight-line grid-drawings of outer- planar graphs in o (n 2 )area remains open.
Research supported by NSERC.The author would like to thank Erik Demaine, Henk Meijer,Steve Wismath and the Algorithmic Problem Session Group at the University of Waterloo for inspiring discussions.
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
P. Bertolazzi, R.F. Cohen, G. DiBattista, R. Tamassia,and I.G. Tollis. How to drawa series-parallel digraph.Intl.J.Comput.Geom.Appl., 4:385–402,1994.
T. Biedl, B. Madden, and I. Tollis.The three-phase method:A unified approach to orthogonal graph drawing.In Graph Drawing (GD’ 97),volume 1353of Lecture Notes in Computer Science,pages 391–402.Springer-Verlag,1998.
N. Castañeda and J. Urrutia. Straight line embeddings of planar graphs on point sets. In Canadian Conference on Computational Geometry (CCCG’ 96),pages 312–318,1996.
G. DiBattista, P. Eades, R. Tamassia,and I. Tollis.Graph Drawing: Algorithms for Geometric Representations of Graphs.Prentice-Hall,1998.
I.Fáry.On straight line representation of planar graphs. Acta.Sci.Math. Szeged,11:229–233,1948.
U. Föβmeier and M. Kaufmann.Drawing high degree graphs with low bend numbers.In F. Brandenburg,editor,Symposium on Graph Drawing 95,volume 1027of Lecture Notes in Computer Science, pages 254–266. Springer-Verlag,1996.
U. Föβmeier, G. Kant,and M. Kaufmann.2-visibility drawings of planar graphs.In S. North,editor,Symposium on Graph Drawing,GD 96,volume 1190 of Lecture Notes in Computer Science, pages 155–168.Springer-Verlag,1997.
H. deFraysseix, J. Pach,and R. Pollack.Small sets supporting fary embeddings of planar graphs.In Twentieth Annual ACM Symposium on Theory of Computing,pages 426–433,1988.
H. deFraysseix, J. Pach,and R. Pollack.How to drawa planar graph on a grid.Combinatorica,10:41–51,1990.
A. Garg, M.T. Goodrich,and R. Tamassia.Planar upward tree drawings with optimal area. International J.Computational Geometry Applications,6:333–356,1996.
G. Kant.Drawing planar graphs using the canonical ordering.Algorithmica,16:4–32,1996.
C. Leiserson. Area-efficient graph layouts (for VLSI). In 21st IEEE Symposium on Foundations of Computer Science, pages 270–281,1980.
W. Schnyder.Embedding planar graphs on the grid. In 1st Annual ACM-SIAM Symposium on Discrete Algorithms,pages 138–148,1990.
Y. Shiloach. Arrangements of Planar Graphs on the Planar Lattice. PhD thesis,Weizmann Institute of Science,1976.
S. Stein.Convex maps.In Amer.Math.Soc.,volume 2, pages 464–466,1951.
J.D. Ullman.Computational Aspects of VLSI.Computer Science Press, 1983.
K. Wagner.Bemerkungen zum Vierfarbenproblem. Jahresbericht der Deutschen Mathematiker-Vereinigung,46:26–32,1936.
S. Wismath.Characterizing bar line-of-sight graphs.In 1st ACM Symposium on Computational Geometry,pages 147–152,Baltimore,Maryland, USA,1985.
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
Biedl, T. (2002). Drawing Outer-Planar Graphs in O(n log n )Area. In: Goodrich, M.T., Kobourov, S.G. (eds) Graph Drawing. GD 2002. Lecture Notes in Computer Science, vol 2528. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36151-0_6
Download citation
DOI: https://doi.org/10.1007/3-540-36151-0_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00158-4
Online ISBN: 978-3-540-36151-0
eBook Packages: Springer Book Archive