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

输送带的存在和硬度

Existence and hardness of conveyor belts

Molly Baird, Sara C. Billey, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor Fekete, Graham Gordon, Sean Griffin, Joseph S. B. Mitchell, Joshua P. Swanson

摘要:

Manuel Abellanas的一个公开问题是,是否平面上的每一组不相交的封闭单位圆盘都可以通过传送带连接起来,这意味着一条紧的简单封闭曲线可能多次接触每个圆盘的边界。我们证明了三个主要结果。首先,对于其中心既为$x$ -单调又为$y$ -单调的单位盘,或者其中心具有相差至少两个单位的$x$ -坐标的单位盘,传送带总是存在并且可以被有效地找到。第二,确定不同半径的圆盘是否有传送带是NP完全的,当我们限制传送带只接触圆盘一次时,它仍然是NP完全的。第三,任意半径的$n$圆盘的任何不相交集合都可以被$O(n)$“引导”圆盘扩充,这样扩充的系统有一个传送带正好接触每个圆盘一次,回答了Demaine,Demaine和Palop的猜想。

英文摘要:

An open problem of Manuel Abellanas asks whether every set of disjoint closed unit disks in the plane can be connected by a conveyor belt, which means a tight simple closed curve that touches the boundary of each disk, possibly multiple times. We prove three main results. First, for unit disks whose centers are both $x$-monotone and $y$-monotone, or whose centers have $x$-coordinates that differ by at least two units, a conveyor belt always exists and can be found efficiently. Second, it is NP-complete to determine whether disks of varying radii have a conveyor belt, and it remains NP-complete when we constrain the belt to touch disks exactly once. Third, any disjoint set of $n$ disks of arbitrary radii can be augmented by $O(n)$ "guide" disks so that the augmented system has a conveyor belt touching each disk exactly once, answering a conjecture of Demaine, Demaine, and Palop.

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

↑