Lecture 16: Vertex & Orthogonal Unfolding

TL;DR

The Cauchy-Steinitz rigidity theorem states that if two convex polyhedra have the same combinatorial structure and congruent faces, they are the same polyhedron.

Transcript

PROFESSOR: All right. Let's get started. So we are continuing the theme of unfolding polyhedra, and the general picture we are thinking about in terms of edge unfolding versus general unfolding which are these two pictures. Top is an edge unfolding of the cube. Bottom is a general unfolding of the cube. If you have a complex polyhedron, we found ge... Read More

Key Insights

• 😀 The Cauchy-Steinitz rigidity theorem states that two convex polyhedra with the same combinatorial structure and congruent faces must be the same polyhedron.
• 🙏 Folding and unfolding are inverse operations that involve transforming a polyhedron into a flat surface and vice versa.

Questions & Answers

Q: What is the Cauchy-Steinitz rigidity theorem?

The Cauchy-Steinitz rigidity theorem states that if two convex polyhedra have the same combinatorial structure and congruent faces, then they are the same polyhedron.

Q: What is the difference between folding and unfolding a polyhedron?

Folding a polyhedron involves gluing and bending a flat surface to create a three-dimensional shape, while unfolding involves cutting a three-dimensional shape and flattening it into a flat surface.

Q: Can any polyhedra be unfolded into a flat surface?

No, not all polyhedra can be unfolded into a flat surface. The ability to unfold depends on the combinatorial structure and congruence of the faces of the polyhedron.

Summary & Key Takeaways

• Folding a polygon into a polyhedron involves gluing edges together and forming congruent faces.

• Unfolding a polyhedron involves cutting the polyhedron and flattening it into a polygon.

• The Cauchy-Steinitz rigidity theorem states that if two convex polyhedra have the same combinatorial structure and congruent faces, they must be the same polyhedron.

• The theorem holds true for convex polyhedra, but not for non-convex polyhedra.