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--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Origami-enabled deformable silicon solar cells
Modelling DNA origami self-assembly at the domain level
Automated Sequence Design of 3D Polyhedral Wireframe DNA Origami with Honeycomb Edges
Journal Article
·
Sun Feb 23 23:00:00 EST 2014
· Applied Physics Letters
·
OSTI ID:22293109
Modelling DNA origami self-assembly at the domain level
Journal Article
·
Wed Oct 28 00:00:00 EDT 2015
· Journal of Chemical Physics
·
OSTI ID:22493184
Automated Sequence Design of 3D Polyhedral Wireframe DNA Origami with Honeycomb Edges
Journal Article
·
Wed Jan 02 19:00:00 EST 2019
· ACS Nano
·
OSTI ID:1507153