Advertisement

Undecidability of Folding

  • Ryuhei UeharaEmail author
Chapter
  • 148 Downloads

Abstract

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.

Reference

  1. [DO07]
    E.D. Demaine, J. O’Rourke, Geometric Folding Algorithms: Linkages, Origami (Polyhedra, Cambridge, 2007)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.JAISTIshikawaJapan

Personalised recommendations