无限全层简单折叠
Infinite All-Layers Simple Foldability
摘要:
我们研究的问题,决定是否折痕图案可以折叠的简单折叠(折叠沿一条线在一个时间)下的无限所有层模型介绍了[秋田谷等人,2017],其中每个简单折叠由无限线定义,并且必须折叠与这条线相交的所有纸层。该模型的动机是制造中的折叠,如金属板弯曲。我们改进了[Arkin等人,2004]给出了一个确定性的$O(n)$ -时间算法来确定全层模型中一维折痕图案的简单可折叠性。然后,我们扩展到2D的一维结果,表明在这个模型中的简单的可折叠性可以决定在线性时间轴对齐的二维正交纸上的未分配的轴对齐的正交折痕图案。另一方面,我们表明,简单的可折叠性是强NP-完全的,如果一个子集的折痕有一个山谷的分配,即使是一个轴对齐的矩形纸。
英文摘要:
We study the problem of deciding whether a crease pattern can be folded by simple folds (folding along one line at a time) under the infinite all-layers model introduced by [Akitaya et al., 2017], in which each simple fold is defined by an infinite line and must fold all layers of paper that intersect this line. This model is motivated by folding in manufacturing such as sheet-metal bending. We improve on [Arkin et al., 2004] by giving a deterministic $O(n)$-time algorithm to decide simple foldability of 1D crease patterns in the all-layers model. Then we extend this 1D result to 2D, showing that simple foldability in this model can be decided in linear time for unassigned axis-aligned orthogonal crease patterns on axis-aligned 2D orthogonal paper. On the other hand, we show that simple foldability is strongly NP-complete if a subset of the creases have a mountain-valley assignment, even for an axis-aligned rectangle of paper.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。