| Article ID: | iaor2009143 |
| Country: | Netherlands |
| Volume: | 105 |
| Issue: | 4 |
| Start Page Number: | 121 |
| End Page Number: | 123 |
| Publication Date: | Feb 2008 |
| Journal: | Information Processing Letters |
| Authors: | Spillner Andreas, Dietel Jana, Hecker Hans-Dietrich |
| Keywords: | geometry |
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.