6.885: Folding and Unfolding in Computational Geometry (Fall 2004)

Prof. Erik Demaine

Lecture 10 -- Page 5 -- 150 DPI

[<< prev lecture <<] -- [< prev page <] -- [> next page >] -- [>> next lecture >>] -- [up to index]

Switch to 50 DPI or 72 DPI or 100 DPI or 150 DPI or 200 DPI

Lecture 10: Polyhedron (un)folding in general, polyhedron unfolding in particular: edge unfoldings, general unfoldings, main questions and results, curvature, source unfolding, star unfolding, ununfoldable polyhedra

Page 5: Fewest nets problem: c F upper bounds for c < 1. Edge unfolding nonconvex polyhedra: orthogonal ununfoldable polyhedra with "essentially nonconvex" topology, triangulated ununfoldable polyhedron with "essentially convex" topology.

A paper by Biedl et al. presents the orthogonal ununfoldable polyhedra. The paper by Bern, Demaine, Eppstein, Kuo, Mantler, and Snoeyink presents the triangulated ununfoldable polyhedron. A paper by Branko Grünbaum presents another ununfoldable polyhedron and some additional conjectures about "unununfoldable" polyhedra.

These are rough, personal lecture notes handwritten by Erik Demaine used during lecture. Their primary purpose is for reading/review by students of the class. Accessibility

Printable PostScript (requires Level-2 PostScript)

[<< prev lecture <<] -- [< prev page <] -- [> next page >] -- [>> next lecture >>] -- [up to index]

Switch to 50 DPI or 72 DPI or 100 DPI or 150 DPI or 200 DPI