6 citations · 7 across the 3 of their papers we have counts for
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.DS2014★ 1 cited
Facility location problems in the constant work-space read-only memory model
Binay K. Bhattacharya, Minati De, Subhas C. Nandy +1
Facility location problems are captivating both from theoretical and practical point of view. In this paper, we study some fundamental facility location problems from the space-eff…
cs.CG2012★ 6 cited
Space-efficient Algorithms for Visibility Problems in Simple Polygon
Minati De, Anil Maheshwari, Subhas C. Nandy
Given a simple polygon consisting of vertices, we study the problem of designing space-efficient algorithms for computing (i) the visibility polygon of a point inside ,…