Improved bounds on weak ε-nets for convex sets

LetS be a set ofn points in ℝ d . A setW is aweak e-net for (convex ranges of)S if, for anyT⊆S containing en points, the convex hull ofT intersectsW. We show the existence of weak e-nets of size\(O((1/\varepsilon ^d )\log ^{\beta _d } (1/\varepsilon ))\), whereβ2=0,β3=1, andβ d ≈0.149·2d-1(d-1)!, improving a previous bound of Alonet al. Such a net can be computed effectively. We also consider two special cases: whenS is a planar point set in convex position, we prove the existence of a net of sizeO((1/e) log1.6(1/e)). In the case whereS consists of the vertices of a regular polygon, we use an argument from hyperbolic geometry to exhibit an optimal net of sizeO(1/e), which improves a previous bound of Capoyleas.