An Improved Bound for Weak Epsilon-Nets in the Plane
Combinatorics
2022-07-22 v2 Computational Geometry
Discrete Mathematics
Abstract
We show that for any finite set of points in the plane and there exist points in , for arbitrary small , that pierce every convex set with . This is the first improvement of the bound of that was obtained in 1992 by Alon, B\'{a}r\'{a}ny, F\"{u}redi and Kleitman for general point sets in the plane.
Cite
@article{arxiv.1808.02686,
title = {An Improved Bound for Weak Epsilon-Nets in the Plane},
author = {Natan Rubin},
journal= {arXiv preprint arXiv:1808.02686},
year = {2022}
}
Comments
A preliminary version to appear in the proceedings of FOCS 2018. Full version to appear in Journal of ACM