论文标题
高效的细分折叠很难
Efficient Segment Folding is Hard
论文作者
论文摘要
我们介绍了一个计算折纸问题，我们称之为段折叠问题：给定飞机中的$ n $线段的一组，目的是在最小折叠步骤中沿所有细分市场进行折痕。请注意，折叠可能会改变片段之间的相对位置，并且一个细分可能会分为两个。我们表明，确定是否可以将$ n $ line段折叠为$ n $简单的折叠操作是NP-HARD。
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.
