A note on the combinatorial structure of the visibility graph in simple polygons
DOI10.1016/0304-3975(95)95693-EzbMATH Open0874.68285MaRDI QIDQ673765FDOQ673765
Authors: Lakshman Prasad, S. S. Iyengar 
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Automated systems (robots, etc.) in control theory (93C85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A unified approach to visibility representations of planar graphs
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- Visibility and intersection problems in plane geometry
- Shape from probing
- An optimal visibility graph algorithm for triangulated simple polygons
- A linear algorithm for computing the visibility polygon from a point
- On recognizing and characterizing visibility graphs of simple polygons
- Title not available (Why is that?)
- A note on the combinatorial structure of the visibility graph in simple polygons
Cited In (6)
- VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
- New Results on Visibility in Simple Polygons
- A P-Completeness Result for Visibility Graphs of Simple Polygons
- Performance bounds for planning in unknown terrain
- A note on the combinatorial structure of the visibility graph in simple polygons
This page was built for publication: A note on the combinatorial structure of the visibility graph in simple polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673765)
