@techreport{oai:ipsj.ixsq.nii.ac.jp:00225664,
 author = {Ryuhei, Uehara and Ryuhei, Uehara},
 issue = {13},
 month = {May},
 note = {We investigate a natural variant of the fold-and-cut problem. We are given a long paper strip P and a polygonal line, which consists of a sequence of line segments, drawn on P. We cut all the line segments by one complete straight cut after overlapping all of them by a sequence of simple foldings. Our goal is to minimize the number of simple foldings to do that. When the polygonal line satisfies some certain geometric conditions, we can find a shortest sequence of simple foldings for the given polygonal line that consists of n line segments in O(n3) time and O(n2) space., We investigate a natural variant of the fold-and-cut problem. We are given a long paper strip P and a polygonal line, which consists of a sequence of line segments, drawn on P. We cut all the line segments by one complete straight cut after overlapping all of them by a sequence of simple foldings. Our goal is to minimize the number of simple foldings to do that. When the polygonal line satisfies some certain geometric conditions, we can find a shortest sequence of simple foldings for the given polygonal line that consists of n line segments in O(n3) time and O(n2) space.},
 title = {Optimal Simple Fold-and-Cut of a Polygonal Line},
 year = {2023}
}