Art gallery theorems and algorithms
Art gallery theorems and algorithms
Complexity of deciding Tarski algebra
Journal of Symbolic Computation
Illumination of polygons with vertex lights
Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Illuminating Polygons with Vertex pi-Floodlights
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Two-Floodlight Illumination of Convex Polygons
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
The Complexity of Illuminating Polygons by alpha-flood-lights
Proceedings of the 8th Canadian Conference on Computational Geometry
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Allocating Vertex π-Guards in Simple Polygons via Pseudo-Triangulations
Discrete & Computational Geometry
| Hi-index | 0.00 |
The floodlight illumination problem asks whether there exists a one-to-one placement of n floodlights illuminating infinite wedges of angles @a"1,...,@a"n at n sites p"1,...,p"n in a plane such that a given infinite wedge W of angle @q located at point q is completely illuminated by the floodlights. We prove that this problem is NP-hard, closing an open problem posed by Demaine and O'Rourke (CCCG 2001). In fact, we show that the problem is NP-complete even when @a"i=@a for all 1=