具有给定角和边长度的平面图的平折叠
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
摘要:
当一个平面图具有指定的边长和指定的角度(从$\{0,180^\circ, 360^\circ$ \}中选出)时,它可以折叠成一条无限小的细线,而没有交叉点?这个问题推广了经典的单顶点平面折纸理论,并给出了指定的山谷分配,这对应于一个循环图的情况。我们用两个明显必要但也是充分的条件刻画了这样的平面可折叠图,证明了2001年提出的一个猜想:每个顶点的角之和应该是$360^\circ$,并且图的每个面本身必须是平面可折叠的。这个特征导致一个线性时间算法测试平面图的可折叠性与规定的边长和角度,和一个多项式时间算法计算不同的折叠状态的数量。
英文摘要:
When can a plane graph with prescribed edge lengths and prescribed angles (from among $\{0,180^\circ, 360^\circ$\}) be folded flat to lie in an infinitesimally thin line, without crossings? This problem generalizes the classic theory of single-vertex flat origami with prescribed mountain-valley assignment, which corresponds to the case of a cycle graph. We characterize such flat-foldable plane graphs by two obviously necessary but also sufficient conditions, proving a conjecture made in 2001: the angles at each vertex should sum to $360^\circ$, and every face of the graph must itself be flat foldable. This characterization leads to a linear-time algorithm for testing flat foldability of plane graphs with prescribed edge lengths and angles, and a polynomial-time algorithm for counting the number of distinct folded states.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。