On recognizing and characterizing visibility graphs of simple polygons
From MaRDI portal
Publication:677018
DOI10.1007/BF02770871zbMATH Open0871.68175WikidataQ56504419 ScholiaQ56504419MaRDI QIDQ677018FDOQ677018
Authors: Subir Kumar Ghosh 
Publication date: 23 March 1997
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- An optimal visibility graph algorithm for triangulated simple polygons
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Characterizing and recognizing weak visibility polygons
Cited In (32)
- The vertex-edge visibility graph of a polygon
- Visibility Graphs of Anchor Polygons
- Recognizing Visibility Graphs of Triangulated Irregular Networks
- A necessary condition for a graph to be the visibility graph of a simple polygon
- Visibility graphs and oriented matroids
- On the complexity of half-guarding monotone polygons
- Negative results on characterizing visibility graphs
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon
- Simple Characterization of LR-visibility Polygons
- Title not available (Why is that?)
- A characterization of visibility graphs for pseudo-polygons
- Visibility graphs of anchor polygons
- Non-stretchable pseudo-visibility graphs
- On half guarding polygons
- Visibility concepts in orthogonal polygon recognition
- Computing the maximum clique in the visibility graph of a simple polygon
- Determining bar-representability for ordered weighted graphs
- ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES
- Recognizing visibility graphs of spiral polygons
- Clique-width of point configurations
- New Results on Visibility in Simple Polygons
- Characterizing LR-visibility polygons and related problems
- Disproving a conjecture on planar visibility graphs
- Title not available (Why is that?)
- An optimal visibility graph algorithm for triangulated simple polygons
- Recognition and Complexity of Point Visibility Graphs
- Recognition and complexity of point visibility graphs
- A P-Completeness Result for Visibility Graphs of Simple Polygons
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
- Coloring polygon visibility graphs and their generalizations
- A note on the combinatorial structure of the visibility graph in simple polygons
- Visibility graphs of towers
This page was built for publication: On recognizing and characterizing visibility graphs of simple polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q677018)
