Epsilon-approximations and epsilon-nets
Computational Geometry
2017-08-09 v3 Combinatorics
Probability
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----approximations and -nets---that capture the most important quantitative properties that one would expect from a random sample with respect to an underlying geometric configuration.
Cite
@article{arxiv.1702.03676,
title = {Epsilon-approximations and epsilon-nets},
author = {Nabil H. Mustafa and Kasturi R. Varadarajan},
journal= {arXiv preprint arXiv:1702.03676},
year = {2017}
}
Comments
Chapter 47 in Handbook on Discrete and Computational Geometry, 3rd edition. 27 pages