Given a set S of regions with piece-wise linear boundary and a positive angle α < 90°, we consider the problem of computing the locations and orientations of the minimum number of α-floodlights positioned at points in S which suffice to illuminate the entire x-axis. We show that the problem can be solved in O(n log n) time and O(n) space, where n is the number of vertices of the set S.
@InProceedings{nilsson_et_al:LIPIcs.ISAAC.2021.11, author = {Nilsson, Bengt J. and Orden, David and Palios, Leonidas and Seara, Carlos and \.{Z}yli\'{n}ski, Pawe{\l}}, title = {{Illuminating the x-Axis by \alpha-Floodlights}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {11:1--11:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.11}, URN = {urn:nbn:de:0030-drops-154444}, doi = {10.4230/LIPIcs.ISAAC.2021.11}, annote = {Keywords: Computational Geometry, Visibility, Art Gallery Problems, Floodlights} }
Feedback for Dagstuhl Publishing