6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Fall 2012, MIT OCW): Lecture 21

6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra

6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Fall 2012, MIT OCW). Instructor: Professor Erik Demaine. 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. (from ocw.mit.edu)

Lecture 21 - HP Model & Interlocked Chains

This lecture presents the hydrophobicity (HP) model for protein folding and optimization using parity cases. Interlocked 3D chains are presented through a table depicting different cases for combinations of open and closed chains.

Go to the Course Home or watch other lectures:

Lecture 01 - Overview

Lecture 02 - Simple Folds

Lecture 03 - Single-Vertex Crease Patterns

Lecture 04 - Efficient Origami Design

Lecture 05 - Artistic Origami Design

Lecture 06 - Architectural Origami

Lecture 07 - Origami is Hard

Lecture 08 - Fold & One Cut

Lecture 09 - Pleat Folding

Lecture 10 - Kempe's Universality Theorem

Lecture 11 - Rigidity Theory