104 citations · 1.2k across the 72 of their papers we have counts for
6 papers · 1 filter
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…
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…
Four-connected triangulations of planar point sets
Ajit Arvind Diwan, Subir Kumar Ghosh, Bodhayan Roy
In this paper, we consider the problem of determining in polynomial time whether a given planar point set of points admits 4-connected triangulation. We propose a necessary…
An Algorithm for Computing Constrained Reflection Paths in Simple Polygon
Arijit Bishnu, Subir Kumar Ghosh, Partha Pratim Goswami +2
Let be a source point and be a destination point inside an -vertex simple polygon . Euclidean shortest paths and minimum-link paths between and inside hav…
Some Results On Point Visibility Graphs
Subir Kumar Ghosh, Bodhayan Roy
In this paper, we present three necessary conditions for recognizing point visibility graphs. We show that this recognition problem lies in PSPACE. We state new properties of point…
Unsolved Problems in Visibility Graphs of Points, Segments and Polygons
Subir Kumar Ghosh, Partha Pratim Goswami
In this survey paper, we present open problems and conjectures on visibility graphs of points, segments and polygons along with necessary backgrounds for understanding them.