Article ID Journal Published Year Pages File Type
414333 Computational Geometry 2008 8 Pages PDF
Abstract

Given a set P of n points in Rd and ϵ>0, we consider the problem of constructing weak ϵ-nets for P. We show the following: pick a random sample Q of size O(1/ϵlog(1/ϵ)) from P. Then, with constant probability, a weak ϵ-net of P can be constructed from only the points of Q. This shows that weak ϵ-nets in Rd can be computed from a subset of P of size O(1/ϵlog(1/ϵ)) with only the constant of proportionality depending on the dimension, unlike all previous work where the size of the subset had the dimension in the exponent of 1/ϵ. However, our final weak ϵ-nets still have a large size (with the dimension appearing in the exponent of 1/ϵ).

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics