arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0909.3127cs.CG
收藏

关于$n$点间的最大空平行轴盒

On the largest empty axis-parallel box amidst $n$ points

Adrian Dumitrescu, Minghui Jiang

摘要:

给出了含$n$点的$\RR^d$中平行轴单位超立方体内平行轴空盒的最大体积的第一个非平凡上、下界.对于一个固定的$d$,我们表明,最大体积的顺序是$Θ(\frac{1}{n})$。然后,我们使用的事实,即最大体积是$Ω(\frac{1}{n})$在我们的设计的第一个有效的$(1-\eps)$ -近似算法的以下问题:给定一个轴平行$d$ -维盒$R$在$\RR^d$包含$n$点,计算一个最大体积空轴平行$d$ -维盒包含在$R$。我们的算法的运行时间在$n$中几乎是线性的,对于小的$d$,并且当一个维度上升时仅增加$O(\log{n})$因子。对于$d \geq 4$的这个问题,以前没有有效的精确或近似算法。由于该问题最近已被证明在任意高维中是NP难的(即,当$d$是输入的一部分时),不可能存在有效的精确算法。我们还得到了含有$n$点的$\RR^d$中平行轴单位超立方体内部的平行轴空超立方体的最大体积的严格估计。对于固定的$d$,该最大体积的阶数与$Θ(\frac{1}{n})$相同。在这种情况下,获得了一种更快的$(1-\eps)$近似算法,其在运行时间上对$d$的依赖性更小。

英文摘要:

We give the first nontrivial upper and lower bounds on the maximum volume of an empty axis-parallel box inside an axis-parallel unit hypercube in $\RR^d$ containing $n$ points. For a fixed $d$, we show that the maximum volume is of the order $Θ(\frac{1}{n})$. We then use the fact that the maximum volume is $Ω(\frac{1}{n})$ in our design of the first efficient $(1-\eps)$-approximation algorithm for the following problem: Given an axis-parallel $d$-dimensional box $R$ in $\RR^d$ containing $n$ points, compute a maximum-volume empty axis-parallel $d$-dimensional box contained in $R$. The running time of our algorithm is nearly linear in $n$, for small $d$, and increases only by an $O(\log{n})$ factor when one goes up one dimension. No previous efficient exact or approximation algorithms were known for this problem for $d \geq 4$. As the problem has been recently shown to be NP-hard in arbitrary high dimensions (i.e., when $d$ is part of the input), the existence of efficient exact algorithms is unlikely. We also obtain tight estimates on the maximum volume of an empty axis-parallel hypercube inside an axis-parallel unit hypercube in $\RR^d$ containing $n$ points. For a fixed $d$, this maximum volume is of the same order order $Θ(\frac{1}{n})$. A faster $(1-\eps)$-approximation algorithm, with a milder dependence on $d$ in the running time, is obtained in this case.

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

↑