Abstract
In this chapter, we first clarify the model and problems of one-dimensional origami that we will handle. Roughly, our origami is a long rectangular strip, and crease lines are orthogonal to the long side of the strip. That is, they are parallel to each other. Moreover, these crease lines are placed at regular intervals on the strip. As you can imagine, this is the simplest origami model in one-dimensional. In such a simple model, we have many problems from the viewpoint of algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Notations such as O(f(n)), \(\Omega (f(n))\), \(\Theta (f(n))\) are collectively called O-notation. Although they are not described in detail in this book, they are notations for bounding from above or below by using the main term of functions.
- 2.
- 3.
References
E.M. Arkin, M.A. Bender, E.D. Demaine, M.L. Demaine, J.S.B. Mitchell, S. Sethia, S.S. Skiena, When can you fold a map? Computational Geometry: Theory and Applications29(1), 23–46 (2004)
E.D. Demaine, J. O’Rourke, Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Cambridge University Press, Cambridge, 2007)
R.P. Stanley, Enumerative Combinatorics, vol. 2 (Cambridge University Press, Cambridge, 1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Uehara, R. (2020). One-Dimensional Origami Model and Stamp Folding. In: Introduction to Computational Origami. Springer, Singapore. https://doi.org/10.1007/978-981-15-4470-5_5
Download citation
DOI: https://doi.org/10.1007/978-981-15-4470-5_5
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-4469-9
Online ISBN: 978-981-15-4470-5
eBook Packages: Computer ScienceComputer Science (R0)