We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Chapter 6 covers global flat foldability.This includes determining how we can tell if a crease pattern with multiple vertices will fold flat without forcing the paper to self-intersect, as well as discovering properties that all such crease patterns have, beyond what was covered in the previous chapter.Justin’s Theorem, which is a generalization of Kawasaki’s and Maekawa’s Theorems and whose proof uses elements of basic knot theory, is covered, as are Justin’s non-crossing conditions that provide necessary and sufficient conditions for a general crease pattern to fold flat.The matrix model from Chapter 5 is developed further to create a formal folding map for flat origami.Finally, Bern and Hayes’ seminal proof that determining flat foldability of a given crease pattern is NP-Hard is presented and updated with more recent results on box pleating.
The field of flat-foldable origami is introduced, which involves a mix of geometry and combinantorics.This chapter focuses on local properties of flat origami, meaning the study of how and when a single vertex in an origami crease pattern will be able to fold flat.The classic theorems of Kawasaki and Maekawa are proved and generalizations are made to folding vertices on cone-shaped (i.e., non-developable) paper.The problem of counting valid mountain-valley assignments of flat-foldable vertices is solved, and the configuration space of flat-foldable vertices of a fixed degree is characterized.A matrix model for formalizing flat-vertex folds is introduced, and the chapter ends with historical notes on this topic.
Chapter 10 introduces a more abstract approach to studying origami by considering how we might fold a Riemannian manifold in arbitrary dimension.This generalizes origami in several ways:First, instead of folding flat paper we may consider folding two-dimensional sheets that possess curvature, like the surface of a sphere or a torus.Second, instead of folding flat paper along straight line creases that, when folded flat, reflect one side of the paper onto the other, we may consider folding a three-dimensional manifold along crease planes which reflect one side of space onto the other, or fold n-dimensional space along crease hyperplanes of dimension (n?1).Work in this area by Robertson (1977) and Lawrence and Spingarn (1989) is presented along with more decent additions, such as generalizations of Maekawa’s Theorem and the sufficient direction of Kawasaki's Theorem in higher dimensions.
Rigid origami describes origami where each face of the crease pattern is flat, as if made from stiff metal.Modeling rigid origami with matrices allows one to describe materials that have been folded into a three-dimensional shape, as opposed to flat origami.This chapter describes this matrix model and proves its key features.In addition, a generalization of Maekawa’s Theorem for three-dimensional rigid origami is introduced, as is modeling rigid origami with the Gauss map from differential geometry.The latter turns out to be a useful tool for the remainder of the book.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.