SCCI Digital Library and Forum

Menu

Home
About Us
Video Library
eBooks
SCCI Forum

Home » Applied Sciences » Engineering » Electrical Engineering and Computer Science (M-I-T) » Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T) » Lecture 16: Vertex & Orthogonal Unfolding (M-I-T)

Lecture 16: Vertex & Orthogonal Unfolding (M-I-T)

Course:Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
Discipline:Applied Sciences
Institute:MIT
Instructor(s): Prof. Erik Demaine
Level:Graduate

Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)

Class 10: Kempe's Universality Theorem (M-I-T)
Class 11: Generic Rigidity (M-I-T)
Class 12: Tensegrities (M-I-T)
Class 13: Locked Linkages (M-I-T)
Class 14: Hinged Dissections (M-I-T)
Class 15: General & Edge Unfolding (M-I-T)
Class 16: Vertex & Orthogonal Unfolding (M-I-T)
Class 17: D-Forms (M-I-T)
Class 19: Refolding & Kinetic Sculpture (M-I-T)
Class 1: Overview (M-I-T)
Class 20: 3D Linkage Folding (M-I-T)
Class 2: Universality & Simple Folds (M-I-T)
Class 3: Single-Vertex Crease Patterns (M-I-T)
Class 4: Efficient Origami Design (M-I-T)
Class 5: Tessellations & Modulars (M-I-T)
Class 6: Architectural Origami (M-I-T)
Class 7: Origami is Hard (M-I-T)
Class 8: Fold & One Cut (M-I-T)
Class 9: Pleat Folding (M-I-T)
Lecture 10: Kempe's Universality Theorem (M-I-T)

Sialkot Chamber of Commerce & Industry P.O. Box 1870, Shahrah-e-Aiwan-e-Sanat-o-Tijarat, Sialkot City 51310 – Pakistan

Facebook Twitter Instagram

Need help?

+92-52-4261881-3

sialkot@scci.com.pk

Copyright © 2026 SCCI Digital Library and Forum | All Right Reserved. Developed By FARAZ SALEEM