MIT

Class 16: Vertex & Orthogonal Unfolding

Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceScience & MathArt, Design & ArchitectureVisual Arts

Om kurset

Description: This class reviews covers topologically convex vertex-ununfoldable cases and unfolding for orthogonal polyhedra, including the approach of heavy-light decomposition. The class also reviews Cauchy’s Rigidity Theorem. Speaker: Erik Demaine