The Complexity of Illuminating Polygons by-FloodLights

The Floodlight Illumination Problem (FIP) is the determination of the minimum number of vertex-lights required to illuminate a given polygon. We show that FIP for simple polygon is NP-hard for any xed in the range 0 < 360 0. We further show that FIP for simple polygons is NP-Hard even when-lights are required to be ush with the edges of the polygon. Our… CONTINUE READING