Supantha Pandit

collaborators

3 papers

cs.CG2019

Variations of largest rectangle recognition amidst a bichromatic point set

Ankush Acharyya, Minati De, Subhas C. Nandy +1

Classical separability problem involving multi-color point sets is an important area of study in computational geometry. In this paper, we study different separability problems for…

cs.CG2016

Faster Approximation for Maximum Independent Set on Unit Disk Graph

Subhas C. Nandy, Supantha Pandit, Sasanka Roy

Maximum independent set from a given set $D$ of unit disks intersecting a horizontal line can be solved in $O (n^{2})$ time and $O (n^{2})$ space. As a corollary, we design a factor 2 ap…

cs.CG2016

Covering segments with unit squares

Ankush Acharyya, Subhas C. Nandy, Supantha Pandit +1

We study several variations of line segment covering problem with axis-parallel unit squares in $I R^{2}$ . A set $S$ of $n$ line segments is given. The objective is to find the mi…