Video details loaded
HomeMIT 6.849 Geometric Folding Algorithms, Fall 2012Lecture 15: General & Edge Unfolding
Lecture 15: General & Edge Unfolding
1:20:50
Description: 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.
Speaker: Erik Demaine