Rigid Origami
People experienced with paper folding will know that there are many origami models that can not be folded rigidly. In fact, it's safer to assume that origami models are not rigid and require a proof when trying to assert that a certain fold is rigid. Who cares? Well, those seeking to use origami in industrial designs often want to know that their chosen fold is an honest-to-goodness rigid fold before devoting the resources for manufacturing, say, stiff cardboard boxes that you hope will fold up properly.
I only know of two published articles that deal with the mathematics of rigid origami. One is by the late David Huffman, of Huffman code fame. The other is by Koryo Miura, famous for his Miura map fold which is a rigid fold that has been used to deploy large solar panel arrays for space satellites. The references are:
However, the model for rigid origami that Huffman and Miura propose (which only uses some basic differential geometry) can be combined with a matrix-model for 3D folding that was first proposed by Toshikazu Kawasaki but was then made more rigorous by sarah-marie belcastro and I. The references for these papers are:
A rigid square twist fold, where we see a certain mountain-valley assignment that allows a square twist to be folded and unfolded rigidly.
How these animations act as "proofs":
Take a look at the example that doesn't work, the degree 4, all valley single vertex fold. To make this animation, I had to define four polygons in Mathematica to represent the four regions of paper in between the crease lines (shown to the right). I picked one of these regions (the bottom left one, call it F1) to remain fixed. I then used the matrix transformations to determine the position of the right-most region, call it F2, if we fold along the crease between this region and F1. Once that is done, I can figure out where the top region, F3, should be if we fold along the crease between F2 and F3. Then I can do the same thing with the left-most region, F4. In this way we start with the fixed region, F1, and proceed around the vertex, counter-clockwise, to determine the positions of all the other regions as we fold the paper up. Furthermore, I chose to do this making all of the creases valleys, with all the same folding angle.
The square twist example is strong edivence of this fold being a valid, rigid fold because we see no gaps between any of the creases as we fold and unfold it. Now, is this a proof? It's probably enough of one to convince most people, but there is another argument that can supplement this matrix model to help. This is the differential geometry approach that Miura and Huffman developed, which shows that geometrically there is nothing preventing the vertices of this model from opening and closing in a rigid manner. This, combined with the matrix model, constitutes, I think, a complete proof that the fold is rigid. One complication, however, is that the differential geometry approach only deals with single vertices. Huffman asserts that expanding this to multiple-vertex origami models follows naturally. However, in other areas of origami mathematics going from local (single-vertex) behavior to global (multiple-vertex) behavior is wrought with complications. Indeed, there are examples of origami models with more than one vertex where each vertex can fold up rigidly by themselves, but in conjunction that can't. Right now the only way to check that such complications do not arise in multiple-vertex models is on a case-by-case basis. For example, it's pretty clear that the square twist example shown above works fine. But developing a general theory on how to deal with this problem is still open. I hope to add more to these pages some day. Like, I want to make an animation demonstrating how Miura's map fold opens and closes rigidly. Stay tuned. (But don't hold your breath!) These pages Copyright 2003 by Thomas Hull. Last changed 11/29/03. Back to the Origami Math page |