European Symposium on Algorithms

ESA 2006: Algorithms – ESA 2006 pp 1-1

Origami, Linkages, and Polyhedra: Folding with Algorithms

  • Erik D. Demaine
Conference paper

DOI: 10.1007/11841036_1

Volume 4168 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Demaine E.D. (2006) Origami, Linkages, and Polyhedra: Folding with Algorithms. In: Azar Y., Erlebach T. (eds) Algorithms – ESA 2006. ESA 2006. Lecture Notes in Computer Science, vol 4168. Springer, Berlin, Heidelberg

Abstract

What forms of origami can be designed automatically by algorithms? What shapes can result by folding a piece of paper flat and making one complete straight cut? What polyhedra can be cut along their surface and unfolded into a flat piece of paper without overlap? When can a linkage of rigid bars be untangled or folded into a desired configuration? Folding and unfolding is a branch of discrete and computational geometry that addresses these and many other intriguing questions. I will give a taste of the many results that have been proved in the past few years, as well as the several exciting open problems that remain open. Many folding problems have applications in areas including manufacturing, robotics, graphics, and protein folding.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Erik D. Demaine
    • 1
  1. 1.MIT Computer Science and Artificial Intelligence LaboratoryCambridgeUSA