A New Method for Efficiently Generating Planar Graph Visibility Representations

  • John M. Boyer
Conference paper

DOI: 10.1007/11618058_47

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3843)
Cite this paper as:
Boyer J.M. (2006) A New Method for Efficiently Generating Planar Graph Visibility Representations. In: Healy P., Nikolov N.S. (eds) Graph Drawing. GD 2005. Lecture Notes in Computer Science, vol 3843. Springer, Berlin, Heidelberg

Abstract

A planar graph visibility representation maps each vertex to a horizontal segment at a vertical position and each edge to a vertical segment at a horizontal position such that each edge segment terminates at the vertical positions of its endpoint vertices and intersects no other horizontal vertex segments. The first O(n) algorithms for producing visibility representations were presented in [4, 5]. These were based on pre-processing to compute both an st-numbering and the dual of the planar graph, which were then used with the combinatorial planar embedding to produce a visibility representation. Greater efficiency is obtained in [3] by eliminating the need for the planar graph dual and by re-using the pre-computed st-numbering in the PQ-tree [1] algorithm.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • John M. Boyer
    • 1
  1. 1.IBM Victoria Software LabVictoriaCanada

Personalised recommendations