# Algorithm generates origami folding patterns for any shape

June 23, 2017In a 1999 paper, Erik Demaine -- now an MIT professor of electrical engineering and computer science, but then an 18-year-old PhD student at the University of Waterloo, in Canada -- described an algorithm that could determine how to fold a piece of paper into any conceivable 3-D shape.

It was a milestone paper in the field of computational origami, but the algorithm didn't yield very practical folding patterns. Essentially, it took a very long strip of paper and wound it into the desired shape. The resulting structures tended to have lots of seams where the strip doubled back on itself, so they weren't very sturdy.

At the Symposium on Computational Geometry in July, Demaine and Tomohiro Tachi of the University of Tokyo will announce the completion of a quest that began with that 1999 paper: a universal algorithm for folding origami shapes that guarantees a minimum number of seams.

"In 1999, we proved that you could fold any polyhedron, but the way that we showed how to do it was very inefficient," Demaine says. "It's efficient if your initial piece of paper is super-long and skinny. But if you were going to start with a square piece of paper, then that old method would basically fold the square paper down to a thin strip, wasting almost all the material. The new result promises to be much more efficient. It's a totally different strategy for thinking about how to make a polyhedron."

Demaine and Tachi are also working to implement the algorithm in a new version of Origamizer, the free software for generating origami crease patterns whose first version Tachi released in 2008.

**Maintaining boundaries**

The researchers' algorithm designs crease patterns for producing any polyhedron -- that is, a 3-D surface made up of many flat facets. Computer graphics software, for instance, models 3-D objects as polyhedra consisting of many tiny triangles. "Any curved shape you could approximate with lots of little flat sides," Demaine explains.

Technically speaking, the guarantee that the folding will involve the minimum number of seams means that it preserves the "boundaries" of the original piece of paper. Suppose, for instance, that you have a circular piece of paper and want to fold it into a cup. Leaving a smaller circle at the center of the piece of paper flat, you could bunch the sides together in a pleated pattern; in fact, some water-cooler cups are manufactured on this exact design.

In this case, the boundary of the cup -- its rim -- is the same as that of the unfolded circle -- its outer edge. The same would not be true with the folding produced by Demaine and his colleagues' earlier algorithm. There, the cup would consist of a thin strip of paper wrapped round and round in a coil -- and it probably wouldn't hold water.

"The new algorithm is supposed to give you much better, more practical foldings," Demaine says. "We don't know how to quantify that mathematically, exactly, other than it seems to work much better in practice. But we do have one mathematical property that nicely distinguishes the two methods. The new method keeps the boundary of the original piece of paper on the boundary of the surface you're trying to make. We call this watertightness."

A closed surface -- such as a sphere -- doesn't have a boundary, so an origami approximation of it will require a seam where boundaries meet. But "the user gets to choose where to put that boundary," Demaine says. "You can't get an entire closed surface to be watertight, because the boundary has to be somewhere, but you get to choose where that is."

**Lighting fires**

The algorithm begins by mapping the facets of the target polyhedron onto a flat surface. But whereas the facets will be touching when the folding is complete, they can be quite far apart from each other on the flat surface. "You fold away all the extra material and bring together the faces of the polyhedron," Demaine says.

Folding away the extra material can be a very complex process. Folds that draw together multiple faces could involve dozens or even hundreds of separate creases.

Developing a method for automatically calculating those crease patterns involved a number of different insights, but a central one was that they could be approximated by something called a Voronoi diagram. To understand this concept, imagine a grassy plain. A number of fires are set on it simultaneously, and they all spread in all directions at the same rate. The Voronoi diagram -- named after the 19th-century Ukrainian mathematician Gyorgy Voronoi -- describes both the location at which the fires are set and the boundaries at which adjacent fires meet. In Demaine and Tachi's algorithm, the boundaries of a Voronoi diagram define the creases in the paper.

"We have to tweak it a little bit in our setting," Demaine says. "We also imagine simultaneously lighting a fire on the entire polygon of the polyhedron and growing out from there. But that concept was really useful. The challenge is to set up where to light the fires, essentially, so that the Voronoi diagram has all the properties we need."

-end-

**Additional background**

Paper: "Origamizer: A Practical Algorithm for Folding Any Polyhedron http://erikdemaine.org/papers/Origamizer_SoCG2017/paper.pdf

ARCHIVE: "Super Mario Brothers" is hard http://news.mit.edu/2016/mario-brothers-hard-complexity-class-pspace-0601

ARCHIVE: Origami robot folds itself up, crawls away http://news.mit.edu/2014/mobile-folding-robots-0807

ARCHIVE: Bake your own robot http://news.mit.edu/2014/bake-your-own-robot-0530

ARCHIVE: The math of the Rubik's cube http://news.mit.edu/2011/rubiks-cube-0629

Massachusetts Institute of Technology

**Related Algorithm Articles:**

New algorithm to help process biological images

Skoltech researchers have presented a new biological image processing method that accurately picks out specific biological objects in complex images.

Skoltech researchers have presented a new biological image processing method that accurately picks out specific biological objects in complex images.

Skoltech scientists break Google's quantum algorithm

In the near term, Google has devised new quantum enhanced algorithms that operate in the presence of realistic noise.

In the near term, Google has devised new quantum enhanced algorithms that operate in the presence of realistic noise.

The most human algorithm

A team from the research group SEES:lab of the Department of Chemical Engineering of the Universitat Rovira I Virgili and ICREA has made a breakthrough with the development of a new algorithm that makes more accurate predictions and generates mathematical models that also make it possible to understand these predictions.

A team from the research group SEES:lab of the Department of Chemical Engineering of the Universitat Rovira I Virgili and ICREA has made a breakthrough with the development of a new algorithm that makes more accurate predictions and generates mathematical models that also make it possible to understand these predictions.

Algorithm turns cancer gene discovery on its head

Prediction method could help personalize cancer treatments and reveal new drug targets.

Prediction method could help personalize cancer treatments and reveal new drug targets.

New algorithm predicts gestational diabetes

Timely prediction may help prevent the condition using nutritional and lifestyle changes.

Timely prediction may help prevent the condition using nutritional and lifestyle changes.

New algorithm could mean more efficient, accurate equipment for Army

Researchers working on an Army-funded project have developed an algorithm to simulate how electromagnetic waves interact with materials in devices to create equipment more efficiently and accurately.

Researchers working on an Army-funded project have developed an algorithm to simulate how electromagnetic waves interact with materials in devices to create equipment more efficiently and accurately.

Universal algorithm set to boost microscopes

EPFL scientists have developed an algorithm that can determine whether a super-resolution microscope is operating at maximum resolution based on a single image.

EPFL scientists have developed an algorithm that can determine whether a super-resolution microscope is operating at maximum resolution based on a single image.

Algorithm designed to map universe, solve mysteries

Cornell University researchers have developed an algorithm designed to visualize models of the universe in order to solve some of physics' greatest mysteries.

Cornell University researchers have developed an algorithm designed to visualize models of the universe in order to solve some of physics' greatest mysteries.

Algorithm tells robots where nearby humans are headed

A new tool for predicting a person's movement trajectory may help humans and robots work together in close proximity.

A new tool for predicting a person's movement trajectory may help humans and robots work together in close proximity.

Algorithm to transform investment banking with higher returns

A University of Bath researcher has created an algorithm which aims to remove the elements of chance, bias or emotion from investment banking decisions, a development which has the potential to reduce errors in financial decision making and improve financial returns in global markets.

A University of Bath researcher has created an algorithm which aims to remove the elements of chance, bias or emotion from investment banking decisions, a development which has the potential to reduce errors in financial decision making and improve financial returns in global markets.

## Trending Science News

**Current Coronavirus (COVID-19) News**

## Top Science Podcasts

We have hand picked the**top science podcasts of 2020**.

**Now Playing: TED Radio Hour**

**Climate Mindset**

In the past few months, human beings have come together to fight a global threat. This hour, TED speakers explore how our response can be the catalyst to fight another global crisis: climate change. Guests include political strategist Tom Rivett-Carnac, diplomat Christiana Figueres, climate justice activist Xiye Bastida, and writer, illustrator, and artist Oliver Jeffers.

**Now Playing: Science for the People**

**#562 Superbug to Bedside**

By now we're all good and scared about antibiotic resistance, one of the many things coming to get us all. But there's good news, sort of. News antibiotics are coming out! How do they get tested? What does that kind of a trial look like and how does it happen? Host Bethany Brookeshire talks with Matt McCarthy, author of "Superbugs: The Race to Stop an Epidemic", about the ins and outs of testing a new antibiotic in the hospital.

**Now Playing: Radiolab**

**Speedy Beet**

There are few musical moments more well-worn than the first four notes of Beethoven's Fifth Symphony. But in this short, we find out that Beethoven might have made a last-ditch effort to keep his music from ever feeling familiar, to keep pushing his listeners to a kind of psychological limit. Big thanks to our Brooklyn Philharmonic musicians: Deborah Buck and Suzy Perelman on violin, Arash Amini on cello, and Ah Ling Neu on viola. And check out The First Four Notes, Matthew Guerrieri's book on Beethoven's Fifth. Support Radiolab today at Radiolab.org/donate.