Efficient Segment Folding is Hard
Computational Geometry
2022-01-17 v3
Abstract
We introduce a computational origami problem which we call the segment folding problem: given a set of 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 line segments can be folded in simple folding operations.
Cite
@article{arxiv.2012.11062,
title = {Efficient Segment Folding is Hard},
author = {Takashi Horiyama and Fabian Klute and Matias Korman and Irene Parada and Ryuhei Uehara and Katsuhisa Yamanaka},
journal= {arXiv preprint arXiv:2012.11062},
year = {2022}
}