On recognizing and characterizing visibility graphs of simple polygons
From MaRDI portal
Publication:677018
DOI10.1007/BF02770871zbMath0871.68175WikidataQ56504419 ScholiaQ56504419MaRDI QIDQ677018
Publication date: 23 March 1997
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Related Items (16)
A Characterization of Visibility Graphs for Pseudo-polygons ⋮ Characterizing and recognizing the visibility graph of a funnel-shaped polygon ⋮ Negative results on characterizing visibility graphs ⋮ Determining bar-representability for ordered weighted graphs ⋮ The vertex-edge visibility graph of a polygon ⋮ Coloring polygon visibility graphs and their generalizations ⋮ On the complexity of half-guarding monotone polygons ⋮ A note on the combinatorial structure of the visibility graph in simple polygons ⋮ Computing the maximum clique in the visibility graph of a simple polygon ⋮ Visibility graphs of towers ⋮ Recognition and complexity of point visibility graphs ⋮ Non-stretchable pseudo-visibility graphs ⋮ Disproving a conjecture on planar visibility graphs ⋮ Clique-width of point configurations ⋮ Visibility Graphs of Anchor Polygons ⋮ A necessary condition for a graph to be the visibility graph of a simple polygon
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterizing and recognizing weak visibility polygons
- An optimal visibility graph algorithm for triangulated simple polygons
- Hiding people in polygons
- A new necessary condition for the vertex visibility graphs of simple polygons
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
- Recognizing visibility graphs of spiral polygons
- COMPUTATIONAL GEOMETRY COLUMN 18
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
This page was built for publication: On recognizing and characterizing visibility graphs of simple polygons
