混合正交折痕模式的简单折叠复杂性
Complexity of Simple Folding of Mixed Orthogonal Crease Patterns
AI总结:
本文系统研究了混合正交折痕模式的简单折叠复杂性,给出多个一维和二维情形的多项式算法,并证明若干二维及任意纸张情形为强 NP 完全,从而几乎完整刻画了各类简单折叠问题的计算复杂性边界。
摘要:
延续 JCDCGGG 2016 和 2017 的成果,我们解决了简单可折叠性问题的若干新情形——即判定哪些折痕模式可以通过一系列(某种模型下的)简单折叠被折平。我们针对混合折痕模式给出了新的高效算法,其中部分折痕被指定为山折或谷折,而其他折痕未被指定,覆盖所有一维情形以及具有正交单层简单折叠的二维矩形纸张。相比之下,我们证明了在具有若干层简单折叠的二维矩形纸上,混合正交折痕模式是强 NP 完全的,补充了此前关于全层简单折叠的结果。我们还证明了在任意纸张上未指定正交折痕模式的有限简单折叠(无论层数多少)是强 NP 完全的,补充了此前关于已指定折痕模式的结果,并与此前关于无限全层简单折叠的正面结果形成对比。总体而言,我们得到了所有情形下多项式可解与 NP 困难的完整刻画——即在一维/矩形/任意纸张上,已指定/未指定/混合正交折痕模式的有限/无限单层/若干层/全层简单折叠——唯一未解决的情形是任意纸张上已指定正交折痕模式的无限全层简单折叠。
英文摘要:
Continuing results from JCDCGGG 2016 and 2017, we solve several new cases of the simple foldability problem -- deciding which crease patterns can be folded flat by a sequence of (some model of) simple folds. We give new efficient algorithms for mixed crease patterns, where some creases are assigned mountain/valley while others are unassigned, for all 1D cases and for 2D rectangular paper with orthogonal one-layer simple folds. By contrast, we show strong NP-completeness for mixed orthogonal crease patterns on 2D rectangular paper with some-layers simple folds, complementing a previous result for all-layers simple folds. We also prove strong NP-completeness for finite simple folds (no matter the number of layers) of unassigned orthogonal crease patterns on arbitrary paper, complementing a previous result for assigned crease patterns, and contrasting with a previous positive result for infinite all-layers simple folds. In total, we obtain a characterization of polynomial vs. NP-hard for all cases -- finite/infinite one/some/all-layers simple folds of assigned/unassigned/mixed orthogonal crease patterns on 1D/rectangular/arbitrary paper -- except the unsolved case of infinite all-layers simple folds of assigned orthogonal crease patterns on arbitrary paper.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。