A Characterization of Visibility Graphs for Pseudo-Polygons
Computational Geometry
2015-04-27 v1
Abstract
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.
Cite
@article{arxiv.1504.06350,
title = {A Characterization of Visibility Graphs for Pseudo-Polygons},
author = {Matt Gibson and Erik Krohn and Qing Wang},
journal= {arXiv preprint arXiv:1504.06350},
year = {2015}
}