Class 1: Overview

Loading...
MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012
View the complete course: http://ocw.mit.edu/6-849F12
Instructor: Erik Demaine

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.

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

Lecture 2: Simple Folds

Lecture 2: Simple Folds


Lecture 1: Overview

Lecture 1: Overview

Lecture 1: Overview


Erik Demaine: Algorithms Meet Art, Puzzles, and Magic

Erik Demaine: Algorithms Meet Art, Puzzles, and Magic

Erik Demaine: Algorithms Meet Art, Puzzles, and Magic


Class 2: Universality & Simple Folds

Class 2: Universality & Simple Folds

Class 2: Universality & Simple Folds


Lecture 3: Single-Vertex Crease Patterns

Lecture 3: Single-Vertex Crease Patterns

Lecture 3: Single-Vertex Crease Patterns


Lecture 4: Efficient Origami Design

Lecture 4: Efficient Origami Design

Lecture 4: Efficient Origami Design


Class 4: Efficient Origami Design

Class 4: Efficient Origami Design

Class 4: Efficient Origami Design


Class 5: Tessellations & Modulars

Class 5: Tessellations & Modulars

Class 5: Tessellations & Modulars


Lecture 2 for MIT 6.832 (Underactuated Robotics) 2015

Lecture 2 for MIT 6.832 (Underactuated Robotics) 2015

Lecture 2 for MIT 6.832 (Underactuated Robotics) 2015