Explore Universality & Simple Folds in Geometric Folding Algorithms 🧩
Discover the fundamentals of universality and simple folding techniques in MIT's 6.849 course on Geometric Folding Algorithms. Perfect for enthusiasts of origami, linkages, and polyhedra. Watch the full course now!
MIT OpenCourseWare
5.5K views • Aug 26, 2014
About this video
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 begins with a folding exercise of numerical digits. Questions discussed cover strip folding in the context of efficiency, defining pseudo-polynomial, seam placement, and clarifications about simple folds and flat-foldability.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
View the complete course: http://ocw.mit.edu/6-849F12
Instructor: Erik Demaine
This class begins with a folding exercise of numerical digits. Questions discussed cover strip folding in the context of efficiency, defining pseudo-polynomial, seam placement, and clarifications about simple folds and flat-foldability.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
5.5K
Likes
33
Duration
53:05
Published
Aug 26, 2014
User Reviews
4.1
(1) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now