A note on the combinatorial structure of the visibility graph in simple polygons
From MaRDI portal
Publication:673765
DOI10.1016/0304-3975(95)95693-EzbMath0874.68285MaRDI QIDQ673765
S. Sitharama Iyengar, Lakshman Prasad
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Automated systems (robots, etc.) in control theory (93C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (2)
A note on the combinatorial structure of the visibility graph in simple polygons ⋮ Performance bounds for planning in unknown terrain
Cites Work
- A note on the combinatorial structure of the visibility graph in simple polygons
- On recognizing and characterizing visibility graphs of simple polygons
- Visibility and intersection problems in plane geometry
- A unified approach to visibility representations of planar graphs
- An optimal visibility graph algorithm for triangulated simple polygons
- Shape from probing
- A linear algorithm for computing the visibility polygon from a point
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A note on the combinatorial structure of the visibility graph in simple polygons
