6 citations · 8 across the 3 of their papers we have counts for
3 papers
cs.CG2012★ 6 cited
Convex Hull and Linear Programming in Read-only Setup with Limited Work-space
Minati De, Subhas C. Nandy, Sasanka Roy
Prune-and-search is an important paradigm for solving many important geometric problems. We show that the general prune-and-search technique can be implemented where the objects ar…
cs.CG2012
Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles
Ritankar Mandal, Anirban Ghosh, Sasanka Roy +1
Given a set of randomly positioned axis parallel rectangles in 2D, the problem of computing the minimum clique cover (MCC) and maximum independe…
cs.CG2011★ 2 cited
Inplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle
Minati De, Subhas C. Nandy
There is a high demand of space-efficient algorithms in built-in or embedded softwares. In this paper, we consider the problem of designing space-efficient algorithms for computing…