Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational aspects of satisfiability (68R07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Abstract: In this paper, we show that deciding rigid foldability of a given crease pattern using all creases is weakly NP-hard by a reduction from Partition, and that deciding rigid foldability with optional creases is strongly NP-hard by a reduction from 1-in-3 SAT. Unlike flat foldability of origami or flexibility of other kinematic linkages, whose complexity originates in the complexity of the layer ordering and possible self-intersection of the material, rigid foldability from a planar state is hard even though there is no potential self-intersection. In fact, the complexity comes from the combinatorial behavior of the different possible rigid folding configurations at each vertex. The results underpin the fact that it is harder to fold from an unfolded sheet of paper than to unfold a folded state back to a plane, frequently encountered problem when realizing folding-based systems such as self-folding matter and reconfigurable robots.
Recommendations
Cited in
(8)- Efficient segment folding is hard
- Infinite all-layers simple foldability
- Box pleating is hard
- Rigid foldability of the augmented square twist
- Hidden symmetries generate rigid folding mechanisms in periodic origami
- On rigid origami I: piecewise-planar paper with straight-line creases
- \(H^2\)-conformal approximation of Miura surfaces
- Book review of: T. Hull, Origametry. Mathematical methods in paper folding
This page was built for publication: Rigid foldability is NP-hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5120145)
