arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2104.12654cs.CGmath.CO
收藏

高维弱ε-网的更强界

Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions

Natan Rubin

AI总结:

本文针对高维有限点集,构造了基数更小的弱ε-网,在d=3时达到O*(1/ε^2.558),在d≥4时达到o(1/ε^{d-1/2}),首次显著改进了1993年的经典界。

摘要:

给定 ${\mathbb R}^d$ 中的有限点集 $P$,以及 $ε>0$,若 $N\subseteq {\mathbb R}^d$ 刺穿每个满足 $|K\cap P|\geq ε|P|$ 的凸集 $K$,则称 $N$ 为弱 $ε$-网。我们证明,对于任意 $d\geq 3$ 维的有限点集和任意 $ε>0$,可以构造一个弱 $ε$-网,其在 $d=3$ 时的基数为 $\displaystyle O^*\left(\frac{1}{ε^{2.558}}\right)$,在 $d\geq 4$ 的所有维度中基数为 $\displaystyle o\left(\frac{1}{ε^{d-1/2}}\right)$。确切地说,我们的弱 $ε$-网对于任意 $γ>0$ 具有基数 $\displaystyle O\left(\frac{1}{ε^{α_d+γ}}\right)$,其中 $α_d=\left\{\begin{array}{l}2.558 & \text{if} \\ d=3 \\\\3.48 & \text{if} \\ d=4 \left(d+\sqrt{d^2-2d}\right)/2 & \text{if} \\ d\geq 5.\end{array}\right\}$。这是对1993年Chazelle、Edelsbrunner、Grigni、Guibas、Sharir和Welzl针对一般点集在 $d\geq 3$ 维中获得的 $\displaystyle \tilde{O}\left(\frac{1}{ε^d}\right)$ 界的首次重大改进。

英文摘要:

Given a finite point set $P$ in ${\mathbb R}^d$, and $ε>0$ we say that $N\subseteq{ \mathbb R}^d$ is a weak $ε$-net if it pierces every convex set $K$ with $|K\cap P|\geq ε|P|$. We show that for any finite point set in dimension $d\geq 3$, and any $ε>0$, one can construct a weak $ε$-net whose cardinality is $\displaystyle O^*\left(\frac{1}{ε^{2.558}}\right)$ in dimension $d=3$, and $\displaystyle o\left(\frac{1}{ε^{d-1/2}}\right)$ in all dimensions $d\geq 4$. To be precise, our weak $ε$-net has cardinality $\displaystyle O\left(\frac{1}{ε^{α_d+γ}}\right)$ for any $γ>0$, with $$ α_d= \left\{ \begin{array}{l} 2.558 & \text{if} \ d=3 \\3.48 & \text{if} \ d=4 \\\left(d+\sqrt{d^2-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}{ε^d}\right)$ that was obtained in 1993 by Chazelle, Edelsbrunner, Grigni, Guibas, Sharir, and Welzl for general point sets in dimension $d\geq 3$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑