Papers
Topics
Authors
Recent
2000 character limit reached

An Improved Bound for Weak Epsilon-Nets in the Plane (1808.02686v2)

Published 8 Aug 2018 in math.CO, cs.CG, and cs.DM

Abstract: We show that for any finite set $P$ of points in the plane and $\epsilon>0$ there exist $\displaystyle O\left(\frac{1}{\epsilon{3/2+\gamma}}\right)$ points in ${\mathbb{R}}2$, for arbitrary small $\gamma>0$, that pierce every convex set $K$ with $|K\cap P|\geq \epsilon |P|$. This is the first improvement of the bound of $\displaystyle O\left(\frac{1}{\epsilon2}\right)$ that was obtained in 1992 by Alon, B\'{a}r\'{a}ny, F\"{u}redi and Kleitman for general point sets in the plane.

Citations (19)

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.