MIT 6.849 Geometric Folding Algorithms, Fall 2012 - Class 8: Fold & One Cut

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 degree disk-packing fold local feature size mathematical cut molecule scissor cut skeleton tree method vertex

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 demonstration of software for fold and cut. Odd-degree vertices, and a comparison of skeleton method and tree method are discussed. Clarifications on the disk-packing method with a definition for the number of disks are given. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu