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 al...

Full description

Saved in:
Bibliographic Details
Published inAlgorithms - ESA 2015 Vol. 9294; pp. 607 - 618
Main Authors Gibson, Matt, Krohn, Erik, Wang, Qing
Format Book Chapter
LanguageEnglish
Published Germany Springer Berlin / Heidelberg 2015
Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Articulation Point
Boundary Edge
Computer programming / software development
Discrete mathematics
Hamiltonian Cycle
Programming & scripting languages: general
Simple Polygon
Visibility Graph
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:3662483491
9783662483497
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-662-48350-3_51