Media Summary: Class 01: Overview Description: This lecture introduces the inverted structure of the class, the topics covered in the course and its ... Class 15: General & Edge Unfolding Description: This class begins with defining handles and holes, and the Gauss-Bonnet ... Lecture 17: Alexandrov's Theorem, Prerequisites for Class 17 Description: This lecture addresses the mathematical approaches ...

Geometric Folding Algorithms Linkages Origami - Detailed Analysis & Overview

Class 01: Overview Description: This lecture introduces the inverted structure of the class, the topics covered in the course and its ... Class 15: General & Edge Unfolding Description: This class begins with defining handles and holes, and the Gauss-Bonnet ... Lecture 17: Alexandrov's Theorem, Prerequisites for Class 17 Description: This lecture addresses the mathematical approaches ... Lecture 21: HP Model & Interlocked Chains Description: This lecture presents the hydrophobicity (HP) model for protein Class 17: D-Forms Description: This class introduces the pita form and Alexandrov-Pogorelov Theorem. D-forms are discussed ... Lecture 10: Kempe's Universality Theorem, Prerequisites for Class 10 Description: This lecture begins by defining

Photo Gallery

Class 1: Overview for MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Lecture 1: Overview of Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Lecture 8: Fold & One Cut
Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Class 01
Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Class 15
Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Lec 17
Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Lec 06
Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Lec 07
Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Class 04
Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Lec 21
Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Class 17
Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Lec 10
View Detailed Profile
Class 1: Overview for MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Class 1: Overview for MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra

MIT 6.849

Lecture 1: Overview of Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Lecture 1: Overview of Geometric Folding Algorithms: Linkages, Origami, Polyhedra

MIT 6.849

Lecture 8: Fold & One Cut

Lecture 8: Fold & One Cut

...

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Class 01

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Class 01

Class 01: Overview Description: This lecture introduces the inverted structure of the class, the topics covered in the course and its ...

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Class 15

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Class 15

Class 15: General & Edge Unfolding Description: This class begins with defining handles and holes, and the Gauss-Bonnet ...

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Lec 17

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Lec 17

Lecture 17: Alexandrov's Theorem, Prerequisites for Class 17 Description: This lecture addresses the mathematical approaches ...

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Lec 06

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Lec 06

Lecture 06: Architectural

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Lec 07

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Lec 07

Lecture 07:

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Class 04

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Class 04

Class 04: Efficient

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Lec 21

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Lec 21

Lecture 21: HP Model & Interlocked Chains Description: This lecture presents the hydrophobicity (HP) model for protein

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Class 17

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Class 17

Class 17: D-Forms Description: This class introduces the pita form and Alexandrov-Pogorelov Theorem. D-forms are discussed ...

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Lec 10

Geometric Folding Algorithms; Linkages, Origami, Polyhedra - MIT - Lec 10

Lecture 10: Kempe's Universality Theorem, Prerequisites for Class 10 Description: This lecture begins by defining