MIT 6.849 Geometric Folding Algorithms, Fall 2012 - Class 14: Hinged Dissections

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

3d 6-849-geometric-folding-algorithms-linkages-origami-polyhedra-fall-2012 dehn invariant dual graph folding furniture hinged dissection pseudopolynomial reconfigurable robot scale spanning tree

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 focuses on hinged dissections. Examples of hinged dissections and several built, reconfigurable applications are offered Pseudopolynomials, triangulation, and 3D dissections are then discussed. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu