Multiple-guard kernels of simple polygons
From MaRDI portal
Publication:1818909
DOI10.1007/BF01225680zbMath1005.52001MaRDI QIDQ1818909
Publication date: 24 February 2003
Published in: Journal of Geometry (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
52A10: Convex sets in (2) dimensions (including convex curves)
52A30: Variants of convex sets (star-shaped, ((m, n))-convex, etc.)
Cites Work
- Unnamed Item
- Computing the geodesic center of a simple polygon
- Critical visibility and outward rays
- A short proof of Chvatal's Watchman Theorem
- An efficient algorithm for guard placement in polygons with holes
- A combinatorial theorem in plane geometry
- Computational complexity of art gallery problems
- Clear Visibility and the Dimension of Kernels of Starshaped Sets