Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards

Pritam Bhattacharya, Subir Kumar Ghosh, Sudebkumar Pal

The art gallery problem enquires about the least number of guards sufficient to ensure that an art gallery, represented by a simple polygon $P$, is fully guarded. Most standard ver…