Computational geometry: an introduction
Computational geometry: an introduction
NP-Completeness of Stage Illumination Problems
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
| Hi-index | 0.89 |
We consider the problem of illuminating a straight line segment with floodlights. The possible locations of the floodlights are given in advance and we want the total size of the floodlights to be minimum. We show that this problem admits a polynomial time algorithm even if we require that no two floodlights are placed at the same location.