Abstract
We provide the first tight bound for covering a polygon with n vertices and h holes with vertex guards. In particular, we provide tight bounds for the number of floodlights, placed at vertices or on the boundary, sufficient to illuminate the interior or the exterior of an orthogonal polygon with holes. Our results lead directly to simple linear, and thus optimal, algorithms for computing a covering of an orthogonal polygon.