5 papers · 1 filter
Endpoint Covering of Axis-Parallel Segments:Bichromatic and Monochromatic One-Center
Nandana Ghosh, Ankush Acharyya, Rakesh Gupta +1
We study exact one-center optimization for axis-parallel segments using axis-parallel squares under endpoint-based coverage, where a segment is \emph{-covered} if the square con…
Largest-Area Convex Quadrilateral in a D Terrain
Ankush Acharyya, Nandana Ghosh
A D terrain is a simple polygon bounded by a horizontal base and an -monotone upper chain. We study the problem of finding a largest-area convex quadrilateral contained in…
Computing largest minimum color-spanning intervals of imprecise points
Ankush Acharyya, Vahideh Keikha, Maria Saumell +1
We study a geometric facility location problem under imprecision. Given unit intervals in the real line, each with one of colors, the goal is to place one point in each int…
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…
Color spanning Localized query
Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy
Let P be a set of n points and each of the points is colored with one of the k possible colors. We present efficient algorithms to pre-process P such that for a given query point q…