Undecidability of Folding
- 148 Downloads
The concluding chapter of this book is the topic of origami modeling. So far, we mainly consider discrete origami problems, which suit computers. However, when we consider continuous problem on origami, we have to face a gap between discrete and continuous models. Using this gap, we can consider undecidability on origami.
- [DO07]E.D. Demaine, J. O’Rourke, Geometric Folding Algorithms: Linkages, Origami (Polyhedra, Cambridge, 2007)Google Scholar