Abstract
We prove that the interior of every convex polygon with n vertices (n ≥ 4) can be illuminated by four 45°-vertex lights. We restrict each vertex to anchoring at most one floodlight. This answers a question of O’Rourke, Shermer and Streinu [5].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Bose, L. Guibas, A. Lubiw, M. Overmars, D. Souvaine and J. Urrutia, The floodlight problem, Internat. J. Comput. Geom. Appl., 7 (1997), 153–163.
M. Darrah, N. Hagelhans, L. Luquet and A. Wolf, Security cameras and flood-light illumination, DIMACS Educational Module Series, Module 03-3, May 2004, 8–11.
F. Contreras, J. Czyzowicz, N. Fraiji and J. Urrutia, Illuminating triangles and quadrilaterals with vertex floodlights, Proc. 10th Canadian Conference on Computational Geometry, 1998, 58–59.
N. Fraiji, Illuminating triangles, quadrilaterals and convex polygons with vertex floodlights, Masters Thesis, University of Ottawa, Canada, 1999.
J. O’Rourke, T. Shermer and I. Streinu, Illuminating convex polygons with vertex floodlights, Proc. 7th Canadian Conference on Computational Geometry, 1995, 151–156.
J. O’Rourke, Open problems in the combinatorics of visibility and illumination, Advances in Discrete and Computational Geometry (B. Chazelle, J. E. Goodman, R. Pollack, eds.), Contemporary Mathematics, American Mathematical Society, Providence, 1998, 237–243.
J. Urrutia, Art gallery and illumination problems, Handbook of Computational Geometry, North-Holland, 2000, 973–1027.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ismailescu, D. Illuminating a convex polygon with vertex lights. Period Math Hung 57, 177–184 (2008). https://doi.org/10.1007/s10998-008-8177-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10998-008-8177-3