#### Filter Results:

- Full text PDF available (21)

#### Publication Year

2002

2019

- This year (4)
- Last 5 years (36)
- Last 10 years (55)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy
- Comput. Geom.
- 2006

In this paper, we will study the problem of locating the center of smallest enclosing circle of a set P of n points, where the center is constrained to lie on a query line segment. The preprocessing… (More)

- Sasanka Roy, Sandip Das, Subhas C. Nandy
- Comput. Geom.
- 2007

Given a polyhedral terrain with n vertices, the shortest monotone descent path problem deals with finding the shortest path between a pair of points, called source (s) and destination (t) such that… (More)

In this paper, we study the query version of the largest empty space recognition problem. Here, a set of n points P is given in a bounded 2D region. The objective is to preprocess P such that given… (More)

- Sasanka Roy, Sandip Das, Subhas C. Nandy
- STACS
- 2005

Given a polyhedral terrain with n vertices, the shortest monotone descent path problem deals with finding the shortest path between a pair of points, called source (s) and destination (t) such that… (More)

- Arindam Karmakar, Sasanka Roy, Sandip Das
- CCCG
- 2007

Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given set of n points… (More)

- Minati De, Subhas C. Nandy, Sasanka Roy
- ArXiv
- 2012

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 are given in… (More)

- John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda
- Comput. Geom.
- 2011

A new class of geometric query problems are studied in this paper. We are required to preprocess a set of geometric objects $P$ in the plane, so that for any arbitrary query point $q$, the largest… (More)

- Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy
- WALCOM
- 2007

Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient s ystems for providing specialized services has become an… (More)

In the map labeling problem, we are given a set P = {p1, p2, . . . , pn} of point sites distributed on a 2D map. The label of a point pi is an axis-parallel rectangle of specified size. The objective… (More)

- John Augustine, Brian Putnam, Sasanka Roy
- J. Discrete Algorithms
- 2010

The Largest Empty Circle problem seeks the largest circle centered within the convex hull of a set P of n points in R^2 and devoid of points from P. In this paper, we introduce a query version of… (More)