40 episodes

This collection of videos includes lectures from Fall 2010 and class sessions Fall 2012. Class sessions are based on the corresponding lectures, and cover submitted questions, clarifications, additional topics, interactive activities, and open problems. Students are asked to view the relevant lecture videos, recorded in Fall 2010, prior to attending each class. The lecture videos and class videos correspond numerically (e.g., Lecture 1 before Class 1, Lecture 2 before Class 2, and so on). The lecture and class session videos are also available an integrated format (synced notes, slides, and video) on Prof. Demaine's website for this course.

License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

Geometric Folding Algorithms: Linkages, Origami, Polyhedra MIT

- Technology

- JUN 24, 2015
- video
Lecture 1: Overview

Lecture 1: Overview

This lecture introduces the topics covered in the course and its motivation. Examples of applications are provided, types and characterizations of geometric objects, foldability and design questions, and results. Select open problems are also introduced.
- 1 hr 19 min
- JUN 24, 2015
- video
Class 1: Overview

Class 1: Overview

This class introduces the inverted structure of the class, the topics covered in the course and its motivation. Examples of applications are provided, along with types and characterizations of geometric objects, and foldability and design questions.
- 50 min
- JUN 24, 2015
- video
Lecture 2: Simple Folds

Lecture 2: Simple Folds

This lecture begins with definitions of origami terminology and a demonstration of mountain-valley folding. Turn, hide, color reversal gadgets, proofs for folding any shape, Hamiltonian refinement, and foldability with 1D flat folding are presented.
- 1 hr 23 min
- JUN 24, 2015
- video
Class 2: Universality & Simple Folds

Class 2: Universality & Simple Folds

This class begins with a folding exercise of numerical digits. Questions discussed cover strip folding in the context of efficiency, defining pseudo-polynomial, seam placement, and clarifications about simple folds and flat-foldability.
- 53 min
- JUN 24, 2015
- video
Lecture 3: Single-Vertex Crease Patterns

Lecture 3: Single-Vertex Crease Patterns

This lecture explores the local behavior of a crease pattern and characterizing flat-foldability of single-vertex crease patterns. Kawasaki's theorem and Maekawa's theorem are presented as well as the tree method with Robert Lang's TreeMaker.
- 1 hr 23 min
- JUN 24, 2015
- video
Class 3: Single-Vertex Crease Patterns

Class 3: Single-Vertex Crease Patterns

This class reviews algorithms for testing flat-foldability for a 1D MV pattern and for single-vertex MV pattern. An exercise walks through determining local flat-foldability, and questions cover higher dimensions and motivations for flat-foldability.
- 46 min