Art galleries with guards of uniform range of vision

DOI10.1016/S0925-7721(01)00024-4zbMath0998.68193MaRDI QIDQ5959561

Csaba D. Tóth

Publication date: 14 March 2002

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

art gallery

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

On the complexity of half-guarding monotone polygons ⋮ Art gallery problem with guards whose range of vision is \(180^{\circ}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A short proof of Chvatal's Watchman Theorem
• Illumination of polygons with vertex lights
• A combinatorial theorem in plane geometry
• Art gallery problem with guards whose range of vision is \(180^{\circ}\)
• On a generalization of the plank problem

This page was built for publication: Art galleries with guards of uniform range of vision