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
CITATION STYLE
Gibson, M., Krohn, E., & Wang, Q. (2015). A characterization of visibility graphs for pseudo-polygons. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9294, pp. 607–618). Springer Verlag. https://doi.org/10.1007/978-3-662-48350-3_51
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
