Book chapter
Epsilon-approximations and epsilon-nets
Handbook of Discrete and Computational Geometry
Chapman and Hall/CRC, 3rd Edition
2017
Abstract
The use of random samples to approximate properties of geometric configurations has been an influential idea for both combinatorial and algorithmic purposes. This chapter considers two related notions---$\epsilon$-approximations and $\epsilon$-nets---that capture the most important quantitative properties that one would expect from a random sample with respect to an underlying geometric configuration.
Details
- Title: Subtitle
- Epsilon-approximations and epsilon-nets
- Creators
- Nabil Mustafa - Laboratoire d'Informatique Gaspard-MongeKasturi Varadarajan - University of Iowa, Computer Science
- Resource Type
- Book chapter
- Publication Details
- Handbook of Discrete and Computational Geometry
- Edition
- 3rd Edition
- Publisher
- Chapman and Hall/CRC; New York
- Language
- English
- Date published
- 2017
- Academic Unit
- Computer Science
- Record Identifier
- 9984259480202771
Metrics
15 Record Views