On guarding polygons with holes
share
There is an old conjecture by Shermer <cit.> that in a polygon with n vertices and h holes, ⌊n+h3⌋ vertex guards are sufficient to guard the entire polygon. The conjecture is proved for h=1 by Shermer <cit.> and Aggarwal <cit.> seperately. In this paper, we prove a theorem similar to the Shermer's conjecture for a special case where the goal is to guard the vertices of the polygon (not the entire polygon) which is equivalent to finding a dominating set for the visibility graph of the polygon. Our proof also guarantees that the selected vertex guards also cover the entire outer boundary (outer perimeter of the polygon) as well.
READ FULL TEXT