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
Matching points with disks with a common intersection
Upper bounds for stabbing simplices by a line

References

SHOWING 1-10 OF 24 REFERENCES
On k-sets and applications
Hitting Simplices with Points in ℝ3
Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles
Lectures on discrete geometry
  • J. Matousek
  • Computer Science, Mathematics
  • Graduate texts in mathematics
  • 2002
A Point in Many Triangles
  • B. Bukh
  • Mathematics, Computer Science
  • Electron. J. Comb.
  • 2006
Stabbing Simplices by Points and Flats
Selecting Heavily Covered Points
Small strong epsilon nets
Point Selections and Weak e-Nets for Convex Hulls
...
1
2
3
...