MIT 6.849 Geometric Folding Algorithms, Fall 2012 - Class 2: Universality & Simple Folds

4.0 (0)

5 learners

What you'll learn

This course includes

42.5 hours of video
Certificate of completion
Access on mobile and TV

Summary

Keywords

6-849-geometric-folding-algorithms-linkages-origami-polyhedra-fall-2012 color reversal gadget crimp flat-foldability mingling mountain pseudo-polynomial seam placement seam region simple fold strip folding strip weaving

Full Transcript

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