We show that vertex guarding a monotone polygon is NP-hard and construct a constant factor approximation algorithm for interior guarding monotone polygons. Using this algorithm we obtain an approximation algorithm for interior guarding rectilinear polygons that has an approximation factor independent of the number of vertices of the polygon. If the size of the smallest interior guard cover is OPT for a rectilinear polygon, our algorithm produces a guard set of size O(OPT 2 ).
For point guards Nilsson REF gave O(OPT 2 )-approximation algorithms for monotone and simple rectilinear polygons.
Approximate Guarding of Monotone and Rectilinear Polygons
Algorithmica
Algorithmica
Computer Science Mathematics