Class 20: 3D Linkage Folding 
Class 20: 3D Linkage Folding
by MIT / Erik Demaine
Video Lecture 39 of 40
Copyright Information: Erik Demaine. 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012. (Massachusetts Institute of Technology: MIT OpenCourseWare), (Accessed 25 Jan, 2015). License: Creative Commons BY-NC-SA
Not yet rated
Views: 802
Date Added: January 25, 2015

Lecture Description

This class introduces recent research on flattening fixed-angle chains and addresses flipping of pockets in a polygon. Flaws and omissions in proofs on a bounding number of flips are presented along with a correct version of Bing and Kazarinoff's proof.

Course Index

Course Description

This course focuses on the algorithms for analyzing and designing geometric foldings. Topics include reconfiguration of foldable structures, linkages made from one-dimensional rods connected by hinges, folding two-dimensional paper (origami), and unfolding and folding three-dimensional polyhedra. Applications to architecture, robotics, manufacturing, and biology are also covered in this course.

This is an advanced class on computational geometry focusing on folding and unfolding of geometric structures including linkages, proteins, paper, and polyhedra. Examples of problems considered in this field include:

- 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?

Many folding problems have applications in areas including manufacturing, robotics, graphics, and protein folding. This class covers many of the results that have been proved in the past few years, as well as the several exciting open problems that remain open.


There are no comments. Be the first to post one.
  Post comment as a guest user.
Click to login or register:
Your name:
Your email:
(will not appear)
Your comment:
(max. 1000 characters)
Are you human? (Sorry)