Efficient segment folding is hard

Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka

Research output: Contribution to conferencePaperpeer-review

Abstract

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 if n line segments can be folded in n simple folding operations.

Original languageEnglish
Pages177-183
Number of pages7
Publication statusPublished - 2019 Jan 1
Externally publishedYes
Event31st Canadian Conference on Computational Geometry, CCCG 2019 - Edmonton, Canada
Duration: 2019 Aug 82019 Aug 10

Conference

Conference31st Canadian Conference on Computational Geometry, CCCG 2019
CountryCanada
CityEdmonton
Period19/8/819/8/10

ASJC Scopus subject areas

  • Geometry and Topology
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Efficient segment folding is hard'. Together they form a unique fingerprint.

Cite this