13 citations · 13 across the 1 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2017★ 13 cited
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 , is fully guarded. Most standard ver…
cs.CG2014
Approximability of Guarding Weak Visibility Polygons
Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy
The art gallery problem enquires about the least number of guards that are sufficient to ensure that an art gallery, represented by a polygon , is fully guarded. In 1998, the pr…