Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant 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 47 tok/s
Gemini 2.5 Pro 44 tok/s Pro
GPT-5 Medium 13 tok/s Pro
GPT-5 High 12 tok/s Pro
GPT-4o 64 tok/s Pro
Kimi K2 160 tok/s Pro
GPT OSS 120B 452 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions (2104.12654v2)

Published 26 Apr 2021 in cs.CG and math.CO

Abstract: Given a finite point set $P$ in ${\mathbb R}d$, and $\epsilon>0$ we say that $N\subseteq{ \mathbb R}d$ is a weak $\epsilon$-net if it pierces every convex set $K$ with $|K\cap P|\geq \epsilon |P|$. We show that for any finite point set in dimension $d\geq 3$, and any $\epsilon>0$, one can construct a weak $\epsilon$-net whose cardinality is $\displaystyle O*\left(\frac{1}{\epsilon{2.558}}\right)$ in dimension $d=3$, and $\displaystyle o\left(\frac{1}{\epsilon{d-1/2}}\right)$ in all dimensions $d\geq 4$. To be precise, our weak $\epsilon$-net has cardinality $\displaystyle O\left(\frac{1}{\epsilon{\alpha_d+\gamma}}\right)$ for any $\gamma>0$, with $$ \alpha_d= \left{ \begin{array}{l} 2.558 & \text{if} \ d=3 \3.48 & \text{if} \ d=4 \\left(d+\sqrt{d2-2d}\right)/2 & \text{if} \ d\geq 5. \end{array}\right} $$ This is the first significant improvement of the bound of $\displaystyle \tilde{O}\left(\frac{1}{\epsilond}\right)$ that was obtained in 1993 by Chazelle, Edelsbrunner, Grigni, Guibas, Sharir, and Welzl for general point sets in dimension $d\geq 3$.

Citations (8)

Summary

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

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

Collections

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

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)