Illumination of Orthogonal Polygons with Orthogonal Floodlights

We provide the first tight bound for covering an orthogonal polygon with n vertices and h holes with vertex floodlights (guards with restricted angle of vision). In particular, we provide tight bou...

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

[2]  Jorge Urrutia,et al.  Illumination of Polygons with Vertex Lights , 1995, Inf. Process. Lett..

[3]  Joseph O'Rourke.  Computational geometry column 16 , 1992, Int. J. Comput. Geom. Appl..

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

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