WADS 1995: Algorithms and Data Structures pp 62-73

# Two-floodlight illumination of convex polygons

• V. Estivill-Castro
• J. Urrutia
Invited Presentation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 955)

## Abstract

A floodlight of size α is a light source that projects light in a cone of size α. In this paper we study the problem of illuminating a convex polygon using floodlights. We give an O(n2) time algorithm to find an optimal pair of floodlights to illuminate a convex polygon P with n vertices; that is a pair of floodlights to illuminate a convex polygon in such a way that the sum of their sizes is minimized. When our polygon is cocircular (i.e. all of the vertices of P lie on a circle) such a pair of floodlights can be found in linear time.

## References

1. [AGSS]
A. Aggarwal, L.J. Guibas, J. Saxon and P.W. Shor, “A linear time algorithm for computing the Voronoi diagram of a convex polygon”, Discrete and Computational Geometry 4 (1989) 591–604.Google Scholar
2. [BBCUZ]
P. Belleville, P. Bose, J. Czyzowicz, J. Urrutia and J. Zaks, “K-Guarding polygons on the plane”, Proc. 6th. Canadian Conference on Computational Geometry, Saskatoon, Sask. Canada (1994) 381–386.Google Scholar
3. [BGLOSU]
P. Bose, L. Guibas, A. Lubiw, M. Overmars, D. Souvaine and J. Urrutia, “The floodlight illumination problem”, to appear in Int. J. on Computational Geometry.Google Scholar
4. [CV]
V. Chvátal, “A combinatorial theorem in plane geometry”, J. Comb. Theory Ser. B, 18 (1975) 39–41.
5. [CRCU1]
J. Czyzowicz, E. Rivera-Campo and J. Urrutia, “Illuminating rectangles and triangles on the plane”, Journal of Combinatorial Theory (B) 57 (1993) 1–17.
6. [CRCU2]
J. Czyzowicz, E. Rivera-Campo and J. Urrutia, “Optimal floodlight illumination of stages”, Proc. 5th Canadian Conference on Computational Geometry, Waterloo, Ont. Canada (1993) 393–398.Google Scholar
7. [ECO'RUX]
V. Estivill-Castro, J. O'Rourke, J. Urrutia and D. Xu, “Illumination of polygons with vertex floodlights”, Technical Report (TR#037) Department of Computer Science, Smith College, Northampton, MA 01063, Aug. 1994.Google Scholar
8. [ECU]
9. [FT]
L. Fejes Toth, “Illumination of convex discs”, Acta Math. Acad. Sci. Hung. 29 (1977) 355–360.
10. [FI]
S. Fisk, “A short proof of Chvátal's watchman theorem”, J. Comb. Theory, Ser. B 24 (1978) 374.Google Scholar
11. [KKK]
J. Kahn, M. Klawe and D. Kleitman,“Traditional galleries require fewer watchmen”, SIAM J. Algebraic and Discrete Methods 4 (1980) 194–206.Google Scholar
12. [O'R]
J. O'Rourke, Art Gallery Theorems and Algorithms. Oxford University Press, 1987.Google Scholar
13. [O'RX]
J. O"Rourke and D. Xu,“Illumination of polygons with 90° vertex lights”, in Snapshots in Comp. Geometry, Univ. Saskatchewan, Aug. 1994 and Technical Report TR #034, Department of Computer Science, Smith College, July 1994.Google Scholar
14. [SHER]
T. Shermer, “Recent results in Art Galleries”, in Proceedings of the IEEE 80 1992) 1384–1399.
15. [SS]
16. [UZ]
J. Urrutia and J. Zaks, “Illuminating convex sets on the plane”, University of Ottawa Technical Report TR-89 (1989).Google Scholar