MIT 6.849 Geometric Folding Algorithms, Fall 2012 - Lecture 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

hinged locked adornment base slender Kirszbaum's Theorem dissection triangulation hinged dissection configuration open chain hinged polygon

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 lecture introduces adorned chains and slender chains. Proofs involving these definitions, as well as locked polygons and hinged dissections, are presented. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Welcome