Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 153 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 28 tok/s Pro
GPT-5 High 18 tok/s Pro
GPT-4o 100 tok/s Pro
Kimi K2 220 tok/s Pro
GPT OSS 120B 447 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
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.

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.