#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2010

2017

- This year (3)
- Last 5 years (12)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Let P be a set of n points in R d. A point x is said to be a centerpoint of P if x is contained in every convex object that contains more than dn d+1 points of P. We call a point x a strong centerpoint for a family of objects C if x ∈ P is contained in every object C ∈ C that contains more than a constant fraction of points of P. A strong centerpoint does… (More)

We consider various hitting and piercing problems for the family of axis-parallel rectangles induced by a point set. Selection Lemmas on induced objects are classical results in discrete geometry that have been well studied and have applications in many geometric problems like weak epsilon nets and slimming Delaunay triangulations. Selection Lemma type… (More)

We say a family of geometric objects C has (l, k)-property if every subfamily C ⊆ C of cardinality at most l is k-piercable. In this paper we investigate the existence of g(k, d) such that if any family of objects C in R d has the (g(k, d), k)-property, then C is k-piercable. Danzer and Grünbaum showed that g(k, d) is infinite for families of boxes and… (More)

- Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay
- ISAAC
- 2015

- Pradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan
- COCOON
- 2017

- Pradeesha Ashok, Ninad Rajgopal, Sathish Govindarajan
- Int. J. Comput. Geometry Appl.
- 2016

Selection lemmas are classical results in discrete geometry that have been well studied and have applications in many geometric problems like weak epsilon nets and slimming Delaunay triangulations. Selection lemma type results typically show that there exists a point that is contained in many objects that are induced (spanned) by an underlying point set. In… (More)

- Pradeesha Ashok, Sudeshna Kolay, Syed Mohammad Meesum, Saket Saurabh
- Theor. Comput. Sci.
- 2017

- Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi
- Symposium on Computational Geometry
- 2017

Given a 1.5-dimensional terrain T , also known as an x-monotone polygonal chain, the Terrain Guarding problem seeks a set of points of minimum size on T that guards all of the points on T . Here, we say that a point p guards a point q if no point of the line segment pq is strictly below T . The Terrain Guarding problem has been extensively studied for over… (More)

- Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
- Algorithmica
- 2016

We investigate the parameterized complexity of Generalized Red Blue Set Cover (Gen-RBSC), a generalization of the classic Set Cover problem and the more recently studied Red Blue Set Cover problem. Given a universe U containing b blue elements and r red elements, positive integers $$k_\ell $$ k ℓ and $$k_r$$ k r , and a family $$\mathcal F $$ F of $$\ell $$… (More)

- Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
- LATIN
- 2016