Algorithms for visibility representations of planar graphs
- First Online:
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.
Unable to display preview. Download preview PDF.