Box Pleating is Hard

DOI10.1007/978-3-319-48532-4_15zbMath1482.68104OpenAlexW2556263796MaRDI QIDQ2958099

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

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

Related Items (5)

Maximal origami flip graphs of flat-foldable vertices: properties and algorithms ⋮ Counting locally flat-foldable origami configurations via 3-coloring graphs ⋮ MAKING STRIP FOLDING A MONOIDAL CATEGORY ⋮ Infinite all-layers simple foldability ⋮ Unnamed Item

Cites Work

• Unnamed Item
• When can you fold a map?
• Isometric folding of Riemannian manifolds
• The complexity of satisfiability problems

This page was built for publication: Box Pleating is Hard