6 citations · 8 across the 3 of their papers we have counts for
6 papers · 1 filter
Online Class Cover Problem
Minati De, Anil Maheshwari, Ratnadip Mandal
In this paper, we study the online class cover problem where a (finite or infinite) family of geometric objects and a set of red points in are…
Online Geometric Covering and Piercing
Minati De, Saksham Jain, Sarat Varma Kallepalli +1
We consider the online version of the piercing set problem, where geometric objects arrive one by one, and the online algorithm must maintain a valid piercing set for the already a…
Online Geometric Hitting Set and Set Cover Beyond Unit Balls in
Minati De, Ratnadip Mandal, Satyam Singh
We investigate the geometric hitting set problem in the online setup for the range space , where the set is a collection of points…
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…
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…
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…