Art gallery problem with guards whose range of vision is \(180^{\circ}\)
From MaRDI portal
Publication:1595400
DOI10.1016/S0925-7721(00)00023-7zbMath0968.68166OpenAlexW2082825683MaRDI QIDQ1595400
Publication date: 11 February 2001
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(00)00023-7
Related Items (3)
Algorithms for art gallery illumination ⋮ ENERGY-AWARE STAGE ILLUMINATION ⋮ Art galleries with guards of uniform range of vision
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A short proof of Chvatal's Watchman Theorem
- Illumination of polygons with vertex lights
- Note on an art gallery problem
- The vertex-edge visibility graph of a polygon
- A combinatorial theorem in plane geometry
- The Floodlight Problem
- Art galleries with guards of uniform range of vision
This page was built for publication: Art gallery problem with guards whose range of vision is \(180^{\circ}\)
