Art gallery theorems for guarded guards.

DOI10.1016/S0925-7721(03)00039-7zbMath1041.52007MaRDI QIDQ1410595

T. S. Michael, Val Pinciu

Publication date: 14 October 2003

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

zbMATH Keywords

visibilitypolygonsart gallery theorems

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Related Items (6)

Cooperative mobile guards in grids ⋮ Total dominating sets in maximal outerplanar graphs ⋮ Guarding a Polygon Without Losing Touch ⋮ Guarding Art Galleries: The Extra Cost for Sculptures Is Linear ⋮ Tight bounds for beacon-based coverage in simple rectilinear polygons ⋮ How to guard orthogonal polygons: diagonal graphs and vertex covers

Cites Work

• Galleries need fewer mobile guards: A variation on Chvatal's theorem
• A short proof of Chvatal's Watchman Theorem
• An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons
• A combinatorial theorem in plane geometry
• Traditional Galleries Require Fewer Watchmen
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Art gallery theorems for guarded guards.