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(n 2) 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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
V. Chvátal, “A combinatorial theorem in plane geometry”, J. Comb. Theory Ser. B, 18 (1975) 39–41.
J. Czyzowicz, E. Rivera-Campo and J. Urrutia, “Illuminating rectangles and triangles on the plane”, Journal of Combinatorial Theory (B) 57 (1993) 1–17.
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.
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.
V. Estivill-Castro and J. Urrutia, “Optimal floodlight illumination of orthogonal art galleries”, Proc. 6th. Canadian Conference on Computational Geometry, Saskatoon, Sask. Canada (1994) 81–86.
L. Fejes Toth, “Illumination of convex discs”, Acta Math. Acad. Sci. Hung. 29 (1977) 355–360.
S. Fisk, “A short proof of Chvátal's watchman theorem”, J. Comb. Theory, Ser. B 24 (1978) 374.
J. Kahn, M. Klawe and D. Kleitman,“Traditional galleries require fewer watchmen”, SIAM J. Algebraic and Discrete Methods 4 (1980) 194–206.
J. O'Rourke, Art Gallery Theorems and Algorithms. Oxford University Press, 1987.
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.
T. Shermer, “Recent results in Art Galleries”, in Proceedings of the IEEE 80 1992) 1384–1399.
W. Steiger and I. Streinu, “Positive and negative results on the floodlight problem”, in Proc. 6th. Canadian Conference on Computational Geometry, Saskatoon, Sask. Canada, 87–92, 1994.
J. Urrutia and J. Zaks, “Illuminating convex sets on the plane”, University of Ottawa Technical Report TR-89 (1989).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Estivill-Castro, V., Urrutia, J. (1995). Two-floodlight illumination of convex polygons. In: Akl, S.G., Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1995. Lecture Notes in Computer Science, vol 955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60220-8_51
Download citation
DOI: https://doi.org/10.1007/3-540-60220-8_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60220-0
Online ISBN: 978-3-540-44747-4
eBook Packages: Springer Book Archive