Vorträge und Posterpräsentationen (mit Tagungsband-Eintrag):
T. Horiyama, F. Klute, M. Korman, I. Parada, R. Uehara, K. Yamanaka:
"Efficient Segment Folding is Hard";
Vortrag: Canadian Conference on Computational Geometry,
Edmonton, Alberta, Canada;
08.08.2019
- 10.08.2019; in: "Proceedings of the 31st Canadian Conference on Computational Geometry",
(2019),
8 S.
Kurzfassung englisch:
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 po-
sition between the segments, and a segment could split
into two. We show that it is NP-hard to determine if n
line segments can be folded in n simple folding opera-
tions.
Elektronische Version der Publikation:
https://publik.tuwien.ac.at/files/publik_284642.pdf
Erstellt aus der Publikationsdatenbank der Technischen Universität Wien.