Note on an art gallery problem
From MaRDI portal
Publication:1388132
DOI10.1016/S0925-7721(97)00029-1zbMath0896.68141OpenAlexW2052223962MaRDI QIDQ1388132
Publication date: 1 October 1998
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(97)00029-1
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
ENERGY-AWARE STAGE ILLUMINATION ⋮ Art gallery problem with guards whose range of vision is \(180^{\circ}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Illuminating rectangles and triangles on the plane
- Triangulating a simple polygon in linear time
- A short proof of Chvatal's Watchman Theorem
- Illumination of polygons with vertex lights
- A combinatorial theorem in plane geometry
- Illumination of Orthogonal Polygons with Orthogonal Floodlights
- Two-floodlight illumination of convex polygons
This page was built for publication: Note on an art gallery problem