Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Combinatorics of Flat Folds: a Survey

Published 3 Jul 2013 in math.MG and math.CO | (1307.1065v1)

Abstract: We survey results on the foldability of flat origami models. The main topics are the question of when a given crease pattern can fold flat, the combinatorics of mountain and valley creases, and counting how many ways a given crease pattern can be folded. In particular, we explore generalizations of Maekawa's and Kawasaki's Theorems, develop a necessary and sufficient condition for a given assignment of mountains and valleys to fold up in a special case of single vertex folds, and describe recursive formulas to enumerate the number of ways that single vertex in a crease pattern can be folded.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.