具有最优最坏情况密度的装箱问题
Packing Disks into Disks with Optimal Worst-Case Density
摘要:
我们为将圆盘包装到圆形容器中所产生的基本问题提供了严格的结果:圆盘中包装圆盘的临界密度为0.5。这意味着总面积为$δ\leq 1/2$的任何磁盘集(不一定相等)总是可以打包成面积为1的磁盘;另一方面,对于任何$\varepsilon>0$,都有面积为$1/2+\varepsilon$的磁盘集不能打包。证明使用仔细的手动分析,辅之以基于区间算术的小自动部分。除了基本的数学重要性,我们的结果也是有用的黑盒引理的递归包装算法的分析。
英文摘要:
We provide a tight result for a fundamental problem arising from packing disks into a circular container: The critical density of packing disks in a disk is 0.5. This implies that any set of (not necessarily equal) disks of total area $δ\leq 1/2$ can always be packed into a disk of area 1; on the other hand, for any $\varepsilon>0$ there are sets of disks of area $1/2+\varepsilon$ that cannot be packed. The proof uses a careful manual analysis, complemented by a minor automatic part that is based on interval arithmetic. Beyond the basic mathematical importance, our result is also useful as a blackbox lemma for the analysis of recursive packing algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。