2 research outputs found
A Characterization of Visibility Graphs for Pseudo-Polygons
In this paper, we give a characterization of the visibility graphs of
pseudo-polygons. We first identify some key combinatorial properties of
pseudo-polygons, and we then give a set of five necessary conditions based off
our identified properties. We then prove that these necessary conditions are
also sufficient via a reduction to a characterization of vertex-edge visibility
graphs given by O'Rourke and Streinu