Algorithms for visibility representations of planar graphs

  • Roberto Tamassia
  • Ioannis G. Tollis
Contributed Papers

DOI: 10.1007/3-540-16078-7_71

Part of the Lecture Notes in Computer Science book series (LNCS, volume 210)
Cite this paper as:
Tamassia R., Tollis I.G. (1986) 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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1986

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