有效的段折叠很难
Efficient Segment Folding is Hard
摘要:
我们介绍了一个计算折纸问题,我们称之为段折叠问题:给定一组$n$线段在平面上的目的是使折痕沿所有段在最小数目的折叠步骤。请注意,折叠可能会改变片段之间的相对位置,并且片段可能会分裂为两个。我们表明,它是NP-难的,以确定是否$n$线段可以折叠在$n$简单的折叠操作。
英文摘要:
We introduce a computational origami problem which we call the segment folding problem: given a set of $n$ line-segments in the plane the aim is to make creases along all segments in the minimum number of folding steps. Note that a folding might alter the relative position between the segments, and a segment could split into two. We show that it is NP-hard to determine whether $n$ line segments can be folded in $n$ simple folding operations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。