3 citations · 3 across the 8 of their papers we have counts for
10 papers
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…
Minimum color spanning circle of imprecise points
Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha +2
Let be a set of colored imprecise points, where each point is colored by one of colors. Each imprecise point is specified by a unit disk in which the point lies. W…
Terrain prickliness: theoretical grounds for high complexity viewsheds
Ankush Acharyya, Maarten Löffler, Gert G. T. Meijer +3
An important task in terrain analysis is computing \emph{viewsheds}. A viewshed is the union of all the parts of the terrain that are visible from a given viewpoint or set of viewp…
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…
Range Assignment of Base-Stations Maximizing Coverage Area without Interference
Ankush Acharyya, Minati De, Subhas C. Nandy +1
We study the problem of assigning non-overlapping geometric objects centered at a given set of points such that the sum of area covered by them is maximized. If the points are plac…
Color Spanning Annulus: Square, Rectangle and Equilateral Triangle
Ankush Acharyya, Subhas C. Nandy, Sasanka Roy
In this paper, we study different variations of minimum width color-spanning annulus problem among a set of points in , where each point is ass…
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 . A set of line segments is given. The objective is to find the mi…