# Mathematics of paper folding

(Redirected from Computational origami)

The art of origami or paper folding has received a considerable amount of mathematical study. Fields of interest include a given paper model's flat-foldability (whether the model can be flattened without damaging it) and the use of paper folds to solve mathematical equations.

## History

In 1893 T. Sundara Rao published "Geometric Exercises in Paper Folding" which used paper folding to demonstrate proofs of geometrical constructions.[1] This work was inspired by the use of origami in the kindergarten system. This book had an approximate trisection of angles and implied construction of a cube root was impossible. In 1936 Margharita P. Beloch showed that use of the 'Beloch fold', later used in the sixth of the Huzita–Hatori axioms, allowed the general cubic equation to be solved using origami.[2] In 1949 R C Yeates' book "Geometric Methods" described three allowed constructions corresponding to the first, second, and fifth of the Huzita–Hatori axioms.[3][4] The axioms were discovered by Jacques Justin in 1989.[5] but were overlooked until the first six were rediscovered by Humiaki Huzita in 1991. The first International Meeting of Origami Science and Technology (now known as the International Conference on Origami in Science, Math, and Education) was held in 1989 in Ferrara, Italy.

## Pure origami

### Flat folding

Two-colorability.
Mountain-valley counting.
Angles around a vertex.

The construction of origami models is sometimes shown as crease patterns. The major question about such crease patterns is whether a given crease pattern can be folded to a flat model, and if so, how to fold them; this is an NP-complete problem.[6] Related problems when the creases are orthogonal are called map folding problems. There are four mathematical rules for producing flat-foldable origami crease patterns:[7]

1. The crease patterns are two colorable.
2. Maekawa's theorem: at any vertex the number of valley and mountain folds always differ by two in either direction.
3. Kawasaki's theorem: at any vertex, the sum of all the odd angles adds up to 180 degrees, as do the even.
4. A sheet can never penetrate a fold.

Paper exhibits zero Gaussian curvature at all points on its surface, and only folds naturally along lines of zero curvature. Curved surfaces which can't be flattened can be produced using a non-folded crease in the paper, as is easily done with wet paper or a fingernail.

Assigning a crease pattern mountain and valley folds in order to produce a flat model has been proven by Marshall Bern and Barry Hayes to be NP complete.[8] Further references and technical results are discussed in Part II of Geometric Folding Algorithms.[9]

### Huzita–Hatori axioms

Some classical construction problems of geometry — namely trisecting an arbitrary angle, or doubling the cube — are proven to be unsolvable using compass and straightedge, but can be solved using only a few paper folds.[10] Paper fold strips can be constructed to solve equations up to degree 4. The Huzita–Hatori axioms are an important contribution to this field of study. These describe what can be constructed using a sequence of creases with at most two point or line alignments at once. Complete methods for solving all equations up to degree 4 by applying methods satisfying these axioms are discussed in detail in Geometric Origami.[11]

## Constructions

As a result of origami study through the application of geometric principles, methods such as Haga's theorem have allowed paperfolders to accurately fold the side of a square into thirds, fifths, sevenths, and ninths. Other theorems and methods have allowed paperfolders to get other shapes from a square, such as equilateral triangles, pentagons, hexagons, and special rectangles such as the golden rectangle and the silver rectangle. Methods for folding most regular polygons up to and including the regular 19-gon have been developed.[11]

### Haga's theorems

BQ is always a rational if AP is.

The side of a square can be divided at an arbitrary rational fraction in a variety of ways. Haga's theorems say that a particular set of constructions can be used for such divisions.[12] Surprisingly few folds are necessary to generate large odd fractions. For instance 15 can be generated with three folds; first halve a side, then use Haga's theorem twice to produce first 23 and then 15.

The accompanying diagram shows Haga's first theorem:

$BQ = \frac{2 AP}{1 + AP}.$

The function changing the length AP to QC is self inverse. Let x be AP then a number of other lengths are also rational functions of x. For example:

Haga's first theorem
AP BQ QC AR PQ
$x$ $\frac{2 x}{1+x}$ $\frac{1-x}{1+x}$ $\frac{1-x^2}{2}$ $\frac{1+x^2}{1+x}$
12 23 13 38 56
13 12 12 49 56
23 45 15 518 1315
15 13 23 1225 1315

### Doubling the cube

Doubling the cube: PB/PA = cube root of 2

The classical problem of doubling the cube can be solved using origami. This construction is due to Peter Messer:[13] A square of paper is first creased into three equal strips as shown in the diagram. Then the bottom edge is positioned so the corner point P is on the top edge and the crease mark on the edge meets the other crease mark Q. The length PB will then be the cube root of 2 times the length of AP.[14]

The edge with the crease mark is considered a marked straightedge, something which is not allowed in compass and straightedge constructions. Using a marked straightedge in this way is called a neusis construction in geometry.

### Trisecting an angle

Trisecting the angle CAB

Angle trisection is another of the classical problems that cannot be solved using a compass and unmarked ruler but can be solved using origami. This construction is due to Hisashi Abe.[13] The angle CAB is trisected by making folds PP' and QQ' parallel to the base with QQ' halfway in between. Then point P is folded over to lie on line AC and at the same time point A is made to lie on line QQ' at A'. The angle A'AB is one third of the original angle CAB. This is because PAQ, A'AQ and A'AR are three congruent triangles. Aligning the two points on the two lines is another neusis construction as in the solution to doubling the cube.[15]

## Related problems

The problem of rigid origami, treating the folds as hinges joining two flat, rigid surfaces, such as sheet metal, has great practical importance. For example, the Miura map fold is a rigid fold that has been used to deploy large solar panel arrays for space satellites.

The napkin folding problem is the problem of whether a square or rectangle of paper can be folded so the perimeter of the flat figure is greater than that of the original square.

Curved origami also poses a (very different) set of mathematical challenges.[16] Curved origami allows the paper to form developable surfaces that are not flat.

Wet-folding origami allows an even greater range of shapes.

The maximum number of times an incompressible material can be folded has been derived. With each fold a certain amount of paper is lost to potential folding. The loss function for folding paper in half in a single direction was given to be $L=\tfrac{\pi t}{6} (2^n + 4)(2^n - 1)$, where L is the minimum length of the paper (or other material), t is the material's thickness, and n is the number of folds possible. The distances L and t must be expressed in the same units, such as inches. This result was derived by Gallivan in 2001, who also folded a sheet of paper in half 12 times, contrary to the popular belief that paper of any size could be folded at most eight times. She also derived the equation for folding in alternate directions.[17]

The fold-and-cut problem asks what shapes can be obtained by folding a piece of paper flat, and making a single straight complete cut. The solution, known as the Fold and Cut Theorem, states that any shape with straight sides can be obtained.

## Notes and references

1. ^ T. Sundara Rao (1893). Geometric Exercises in Paper Folding. Addison.
2. ^ Thomas C. Hull (April 2011). "Solving Cubics With Creases: The Work of Beloch and Lill" (PDF). American Mathematical Monthly: 307–315. doi:10.4169/amer.math.monthly.118.04.307.
3. ^ George Edward Martin (1997). Geometric constructions. Springer. p. 145. ISBN 978-0-387-98276-2.
4. ^ Robert Carl Yeates (1949). Geometric Tools. Louisiana State University.
5. ^ Justin, Jacques, "Resolution par le pliage de l'equation du troisieme degre et applications geometriques", reprinted in Proceedings of the First International Meeting of Origami Science and Technology, H. Huzita ed. (1989), pp. 251–261.
6. ^ Thomas C. Hull (2002). "The Combinatorics of Flat Folds: a Survey" (PDF). The Proceedings of the Third International Meeting of Origami Science, Mathematics, and Education. AK Peters. ISBN 978-1-56881-181-9.
7. ^
8. ^ The Complexity of Flat Origami
9. ^ Demaine, Erik; O'Rourke, Joseph (July 2007). "Geometric Folding Algorithms: Linkages, Origami, Polyhedra". Cambridge University Press. ISBN 978-0-521-85757-4.
10. ^ Tom Hull. "Origami and Geometric Constructions".
11. ^ a b Geretschläger, Robert (2008). Geometric Origami. UK: Arbelos. ISBN 978-0-9555477-1-3.
12. ^ Koshiro. "How to Divide the Side of Square Paper". Japan Origami Academic Society.
13. ^ a b Lang, Robert J (2008). "From Flapping Birds to Space Telescopes: The Modern Science of Origami" (PDF). Usenix Conference, Boston, MA.
14. ^ Peter Messer (1986). "Problem 1054". Crux Mathematicorum 12 (10): pp. 284–285.
15. ^ Michael J Winckler; Kathrin D Wold; Hans Georg Bock (2011). "Hands-On Geometry with Origami". Origami 5. CRC Press. p. 225. ISBN 978-1-56881-714-9.
16. ^ Siggraph: "Curved Origami"
17. ^