关于点集中的最大空盒大小的问题
On the size of the largest empty box amidst a point set
AI总结:
研究在固定维度下点集中的最大空盒体积随维度增加的变化,证明最大空盒体积下界随维度增长而增大。
摘要:
在计算几何中,寻找点配置中的最大空轴对齐盒子是一个经典问题。已知当n趋于无穷大时,最大空盒的体积渐近阶为1/n。然而,人们自然假设当维度d增加时,最大空盒的体积也会增加。本文证明了这一点:对于任意n个点在[0,1]^d中的集合,存在一个体积至少为c_d n^{-1}的空盒,其中c_d随着d趋于无穷而趋于无穷。更精确地说,c_d的下界约为log d的量级。
英文摘要:
The problem of finding the largest empty axis-parallel box amidst a point configuration is a classical problem in computational geometry. It is known that the volume of the largest empty box is of asymptotic order $1/n$ for $n\to\infty$ and fixed dimension $d$. However, it is natural to assume that the volume of the largest empty box increases as $d$ gets larger. In the present paper we prove that this actually is the case: for every set of $n$ points in $[0, 1]^d$ there exists an empty box of volume at least $c_d n^{-1}$ , where $c_d \to \infty$ as $d\to \infty$. More precisely, $c_d$ is at least of order roughly $\log d$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。