Resources | Geometric Folding Algorithms: Linkages, Origami, Polyhedra | Electrical Engineering and Computer Science

Course Info

Instructor

Prof. Erik Demaine

Departments

Electrical Engineering and Computer Science

As Taught In

Fall 2012

Level

Graduate

Topics

Learning Resource Types

Lecture Videos

Problem Sets with Solutions

Projects

Instructor Insights

Download Course

Download

file_download Download course

This package contains the same content as the online version of the course. For help downloading and using course materials, read our FAQs.

Assignments

Problem Set 1 Solutions, 6.849 Fall 2012

Problem Set 1, 6.849 Fall 2012

Problem Set 2 Solutions, 6.849 Fall 2012

Problem Set 2, 6.849 Fall 2012

Problem Set 3 Solutions, 6.849 Fall 2012

Problem Set 3, 6.849 Fall 2012

Problem Set 4 Solutions, 6.849 Fall 2012

Problem Set 4, 6.849 Fall 2012

Problem Set 5 Solutions, 6.849 Fall 2012

Problem Set 5, 6.849 Fall 2012

Lecture Notes

Class 1 Notes: Course Overview, 6.849 Fall 2012

Class 1 Slides: Course Overview, 6.849 Fall 2012

Lecture 1 Notes: Course Overview, 6.849 Fall 2010

Class 2 Notes: Origami, Universality, and Simple Folds, 6.849 Fall 2012

Class 2 Slides: Origami, Universality, and Simple Folds, 6.849 Fall 2012

Detailed Descriptions of Class 2 and Lecture 2

Lecture 2 Notes: Origami, Universality, and Simple Folds, 6.849 Fall 2010

Lecture 2 Slides: Origami, Universality, and Simple Folds, 6.849 Fall 2010

Class 3 Notes: Single-Vertex Crease Patterns, 6.849 Fall 2012

Class 3 Slides: Single-Vertex Crease Patterns, 6.849 Fall 2012

See all

Over 2,500 courses & materials

Freely sharing knowledge with learners and educators around the world. Learn more

Accessibility

Creative Commons License

Terms and Conditions

Proud member of:

Browse Course Material

Download

Assignments

Lecture Notes