论文信息 - Illumination with Orthogonal Floodlights

Illumination with Orthogonal Floodlights

We provide the first tight bound for covering a polygon with n vertices and h holes with vertex guards. In particular, we provide tight bounds for the number of floodlights, placed at vertices or on the boundary, sufficient to illuminate the interior or the exterior of an orthogonal polygon with holes. Our results lead directly to simple linear, and thus optimal, algorithms for computing a covering of an orthogonal polygon.

[1] Bernard Chazelle. Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[2] J. O'Rourke. Art gallery theorems and algorithms , 1987 .

[3] J. Kahn,et al. Traditional Galleries Require Fewer Watchmen , 1983 .

[4] Jorge Urrutia,et al. Optimal Floodlight Illumination of Orthogonal Art Galleries , 1994, Canadian Conference on Computational Geometry.

[5] Leonidas J. Guibas,et al. The Floodlight Problem , 1997, Int. J. Comput. Geom. Appl..

[6] Ileana Streinu,et al. Positive and Negative Results on the Floodlight Problem , 1994, CCCG.

[7] T. Shermer. Recent Results in Art Galleries , 1992 .

[8] Ömer Egecioglu,et al. Visibility graphs of staircase polygons and the weak Bruhat order, I: From visibility graphs to maximal chains , 1995, Discret. Comput. Geom..

[9] Frank Hoffmann,et al. On the Rectilinear Art Gallery Problem (Extended Abstract) , 1990, ICALP.

[10] T. C. Shermer,et al. Recent results in art galleries (geometry) , 1992, Proc. IEEE.

[11] Frank Hoffmann,et al. The art gallery theorem for polygons with holes , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.