The Complexity of Flat Origami (Extended Abstract) (1996)
by
Marshall Bern
,
Barry Hayes
In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Bern96thecomplexity,
author = {Marshall Bern and Barry Hayes},
title = {The Complexity of Flat Origami (Extended Abstract)},
booktitle = {In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms},
year = {1996},
pages = {175--183}
}
author = {Marshall Bern and Barry Hayes},
title = {The Complexity of Flat Origami (Extended Abstract)},
booktitle = {In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms},
year = {1996},
pages = {175--183}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
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-complete. We also show that determining a suitable overlap order for flaps is NP-complete, even assuming a valid mountain and valley assignment.
Citations
| 7271 | Computers and Intractability - A Guide to the Theory of NP-Completeness – Garey, Johnson - 1979 |
| 503 | Data Structures and Network Algorithms – Tarjan - 1974 |
| 320 | Matching Theory – Lovász, Plummer - 1986 |
| 118 | A linear-time algorithm for a special case of disjoint set union – Gabow, Tarjan |
| 31 | A computational algorithm for origami design – Lang - 1996 |
| 18 | On the Relation Between Mountaincreases and Valley-creases of a Flat Origami – Kawasaki - 1991 |
| 10 | Curvature and creases: A primer on paper – Huffman - 1976 |
| 9 | Origami for the Connoisseur – Kasahara, Takahama - 1987 |
| 2 | Folding the Universe: Origami from Angelfish to Zen. Vintage Books – Engel - 1989 |
| 2 | On the mathematics of flat origamis. Congressus Numerantium 100 – Hull - 1994 |
| 1 | Abstract in 2nd Int. Meeting of Origami Science – Justin - 1994 |
