Lecture 15: General & Edge Unfolding

preview_player
Показать описание
MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012
Instructor: Erik Demaine

This lecture begins with describing polyhedron unfolding for convex and nonconvex polygons. Algorithms for shortest path solutions and unfoldings are presented along with how to determine whether an edge unfolding exists.

License: Creative Commons BY-NC-SA
Рекомендации по теме
Комментарии
Автор

This is a great instructional video, and these kinds of lectures have to be publicized so people wont miss them out :)

AlexandrBorschchev