A Characterization of Visibility Graphs for Pseudo-polygons

DOI10.1007/978-3-662-48350-3_51zbMath1466.68073arXiv1504.06350OpenAlexW846686646MaRDI QIDQ3452822

Qing Wang, Erik A. Krohn, Matthew R. Gibson

Publication date: 19 November 2015

Published in: Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.06350

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Recognizing Visibility Graphs of Triangulated Irregular Networks

Cites Work

• Unnamed Item
• Decomposition of multiple coverings into more parts
• On recognizing and characterizing visibility graphs of simple polygons
• A new necessary condition for the vertex visibility graphs of simple polygons
• The vertex-edge visibility graph of a polygon
• Characterizing and recognizing the visibility graph of a funnel-shaped polygon
• Negative results on characterizing visibility graphs
• Non-stretchable pseudo-visibility graphs
• Approximating theDomatic Number
• Epsilon nets and union complexity
• Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
• Unsolved problems in visibility graphs of points, segments, and polygons

This page was built for publication: A Characterization of Visibility Graphs for Pseudo-polygons