The complexity of flat origami
Conference
·
OSTI ID:416799
- Xerox, Palo Alto, CA (United States)
- ParcPlace-Digitalk, Inc., Sunnyvale, CA (United States)
We study a basic problem in mathematical origami: determine if a given crease pattern can be folded to a flat origami. We show that assigning mountain and valley folds is NP-hard. We also show that determining a suitable overlap order for flaps is NP-hard, even assuming a valid mountain and valley assignment.
- OSTI ID:
- 416799
- Report Number(s):
- CONF-960121-; TRN: 96:005887-0022
- Resource Relation:
- Conference: 7. annual ACM-SIAM symposium on discrete algorithms, Atlanta, GA (United States), 28-30 Jan 1996; Other Information: PBD: 1996; Related Information: Is Part Of Proceedings of the seventh annual ACM-SIAM symposium on discrete algorithms; PB: 596 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Controlled Mechanical Buckling for Origami-Inspired Construction of 3D Microstructures in Advanced Materials
Origami-enabled deformable silicon solar cells
Automated Sequence Design of 3D Polyhedral Wireframe DNA Origami with Honeycomb Edges
Journal Article
·
Thu Feb 25 00:00:00 EST 2016
· Advanced Functional Materials
·
OSTI ID:416799
+16 more
Origami-enabled deformable silicon solar cells
Journal Article
·
Mon Feb 24 00:00:00 EST 2014
· Applied Physics Letters
·
OSTI ID:416799
+6 more
Automated Sequence Design of 3D Polyhedral Wireframe DNA Origami with Honeycomb Edges
Journal Article
·
Thu Jan 03 00:00:00 EST 2019
· ACS Nano
·
OSTI ID:416799
+4 more