Abstract
We investigate visibility representations of planar graphs, which are constructed by mapping vertices to horizontal segments, and edges to vertical segments that intersect only adjacent vertex-segments. We consider three types of visibility representations, and present linear time algorithms for testing the existence of and constructing visibility representations. Applications of our results can be found in VLSI layout compaction, and in efficient embedding of graphs in the rectilinear grid.
This research was partially supported by the Joint Services Electronics Program under Contract N00014-84-c-0149. Roberto Tamassia was supported in part by a Fulbright grant.
On leave from: Dipartimento di Informatica e Sistemistica — Universita' di Roma, "La Sapienza" — Via Buonarroti 12 - 00185 Roma, Italy.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. Duchet, Y. Hamidoune, M. Las Vergnas, and H. Meyniel, “Representing a Planar Graph by Vertical Lines Joining Different Levels,” Discrete Mathematics, vol. 46, pp. 319–321, 1983.
S. Even and R.E. Tarjan, “Computing an st-Numbering,” Theoretical Computer Science, vol. 2, pp. 339–344, 1976.
S. Even, Graph Algorithms, Computer Science Press, 1979.
J. Hopcroft and R. Tarjan, “Efficient Planarity Testing,” J. of ACM, vol. 21, no. 4, pp. 549–568, 1974.
A. Lempel, S. Even, and I. Cederbaum, “An Algorithm for Planarity Testing of Graphs,” Theory of Graphs, International Symposium, Rome, pp. 215–232, 1966.
F. Luccio, S. Mazzone, and C.K. Wong, “A Note on Visibility Graphos,” Manuscript, Pisa, 1983.
L.A. Melnikov, Problem at the 6th Hungarian Colloquium on Combinatorics, 1981.
R.H.J.M. Otten and J.G. van Wijk, “Graph Representations in Interactive Layout Design,” Proc. IEEE Int. Symposium on Circuits and Systems, New York, pp. 914–918, 1978.
M. Schlag, F. Luccio, P. Maestrini, D.T. Lee, and C.K. Wong, “A Visibility Problem in VLSI Layout Compaction,” pp. 259–282 in Advances in Computing Research, vol. 2, ed. F.P. Preparata. JAI Press Inc., 1985.
J.A. Storer, “On minimal node-cost planar embeddings,” Networks, vol. 14, pp. 181–212, 1984.
R. Tamassia and I.G. Tollis, “A Provably Good Linear Algorithm for Embedding Graphs in the Rectilinear Grid,” Manuscript, Urbana, May 1985.
R. Tamassia and I.G. Tollis, “Plane representations of graphs and visibility between parallel segments,” Technical Report ACT-57, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, April 1985.
C. Thomassen, “Plane Representations of Graphs,” pp. 43–69 in Progress in Graph Theory, ed. J.A. Bondy and U.S.R. Murty, Academic Press, 1984.
S.K. Wismath, “Characterizing bar line-of-sight graphs,” Proc. of ACM Symposium on Computational Geometry, Baltimore, Maryland, pp. 147–152, June 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tamassia, R., Tollis, I.G. (1985). Algorithms for visibility representations of planar graphs. In: Monien, B., Vidal-Naquet, G. (eds) STACS 86. STACS 1986. Lecture Notes in Computer Science, vol 210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_71
Download citation
DOI: https://doi.org/10.1007/3-540-16078-7_71
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16078-6
Online ISBN: 978-3-540-39758-8
eBook Packages: Springer Book Archive