Box pleating is hard

DOI10.1007/978-3-319-48532-4_15MaRDI QIDQ2958099zbMATH OpenOpenAlexFDO

Authors Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, Ryuhei Uehara

Publication date 1 February 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-48532-4_15

zbMATH Keywords

flat foldabilitybox pleatinggrid-aligned gadgets

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational aspects related to convexity (52B55) Polyhedral manifolds (52B70) Geometric constructions in real or complex geometry (51M15)

Recommendations

• scientific article; zbMATH DE number 871913
• Rigid foldability is NP-hard
• When can you fold a map?
• When can a net fold to a polyhedron?
• scientific article; zbMATH DE number 1830752

Cites work

• scientific article; zbMATH DE number 871913 (Why is no real title available?)
• Isometric folding of Riemannian manifolds
• The complexity of satisfiability problems
• When can you fold a map?

Cited in

(11)

• scientific article; zbMATH DE number 6876410 (Why is no real title available?)
• MAKING STRIP FOLDING A MONOIDAL CATEGORY
• Maximal origami flip graphs of flat-foldable vertices: properties and algorithms
• When can you fold a map?
• Counting locally flat-foldable origami configurations via 3-coloring graphs
• Order theory in strip folding
• Flat-foldability for \(1 \times n\) maps with square/diagonal grid patterns
• Rigid foldability is NP-hard
• Infinite all-layers simple foldability
• Generalized offset Pythagorean stretches in box-pleated uniaxial bases
• Book review of: T. Hull, Origametry. Mathematical methods in paper folding

This page was built for publication: Box pleating is hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958099)