# Selection Lemmas for Various Geometric Objects

@article{Ashok2016SelectionLF, title={Selection Lemmas for Various Geometric Objects}, author={P. Ashok and Sathish Govindarajan and N. Rajgopal}, journal={ArXiv}, year={2016}, volume={abs/1401.0443} }

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 the first selection lemma, we consider the set of all the objects induced by a point set P. This question has been widely explored for… Expand

#### Figures, Tables, and Topics from this paper

#### 2 Citations

Matching points with disks with a common intersection

- Mathematics, Computer Science
- Discret. Math.
- 2019

#### References

SHOWING 1-10 OF 24 REFERENCES

Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles

- Computer Science, Mathematics
- Combinatorics, Probability and Computing
- 2004

Stabbing Simplices by Points and Flats

- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2010

Selecting Heavily Covered Points

- Mathematics, Computer Science
- SIAM J. Comput.
- 1994

Point Selections and Weak e-Nets for Convex Hulls

- Computer Science, Mathematics
- Comb. Probab. Comput.
- 1992