Algorithms for visibility representations of planar graphs

  • Roberto Tamassia
  • Ioannis G. Tollis
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 210)


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.


Planar Graph Visibility Representation Hamiltonian Path Vertical Segment Linear Time Algorithm 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    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.Google Scholar
  2. [2]
    S. Even and R.E. Tarjan, “Computing an st-Numbering,” Theoretical Computer Science, vol. 2, pp. 339–344, 1976.CrossRefGoogle Scholar
  3. [3]
    S. Even, Graph Algorithms, Computer Science Press, 1979.Google Scholar
  4. [4]
    J. Hopcroft and R. Tarjan, “Efficient Planarity Testing,” J. of ACM, vol. 21, no. 4, pp. 549–568, 1974.Google Scholar
  5. [5]
    A. Lempel, S. Even, and I. Cederbaum, “An Algorithm for Planarity Testing of Graphs,” Theory of Graphs, International Symposium, Rome, pp. 215–232, 1966.Google Scholar
  6. [6]
    F. Luccio, S. Mazzone, and C.K. Wong, “A Note on Visibility Graphos,” Manuscript, Pisa, 1983.Google Scholar
  7. [7]
    L.A. Melnikov, Problem at the 6th Hungarian Colloquium on Combinatorics, 1981.Google Scholar
  8. [8]
    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.Google Scholar
  9. [9]
    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.Google Scholar
  10. [10]
    J.A. Storer, “On minimal node-cost planar embeddings,” Networks, vol. 14, pp. 181–212, 1984.Google Scholar
  11. [11]
    R. Tamassia and I.G. Tollis, “A Provably Good Linear Algorithm for Embedding Graphs in the Rectilinear Grid,” Manuscript, Urbana, May 1985.Google Scholar
  12. [12]
    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.Google Scholar
  13. [13]
    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.Google Scholar
  14. [14]
    S.K. Wismath, “Characterizing bar line-of-sight graphs,” Proc. of ACM Symposium on Computational Geometry, Baltimore, Maryland, pp. 147–152, June 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Roberto Tamassia
    • 1
  • Ioannis G. Tollis
    • 2
  1. 1.Coordinated Science Laboratory and Department of Electrical and Computer EngineeringUniversity of Illinois at Urbana-ChampaignUrbana
  2. 2.Coordinated Science Laboratory and Department of Computer ScienceUniversity of Illinois at Urbana-ChampaignUrbana

Personalised recommendations