文章基本信息

标题：Packing Disks into Disks with Optimal Worst-Case Density
本地全文：下载
作者：S{'a}ndor P. Fekete ; Phillip Keldenich ; Christian Scheffer 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2019
卷号：129
页码：1-19
DOI：10.4230/LIPIcs.SoCG.2019.35
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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 delta 0 there are sets of disks of area 1/2+epsilon 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.
关键词：Disk packing; packing density; tight worst-case bound; interval arithmetic; approximation