1 / 12

Part III: Polyhedra c: Cauchy’s Rigidity Theorem

Part III: Polyhedra c: Cauchy’s Rigidity Theorem. Joseph O’Rourke Smith College. Outline: Reconstruction of Convex Polyhedra. Cauchy to Sabitov (to an Open Problem) Cauchy’s Rigidity Theorem Aleksandrov’s Theorem Sabitov’s Algorithm. Reconstruction of Convex Polyhedra. graph

carter
Download Presentation

Part III: Polyhedra c: Cauchy’s Rigidity Theorem

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Part III: Polyhedrac: Cauchy’s Rigidity Theorem Joseph O’Rourke Smith College

  2. Outline: Reconstruction of Convex Polyhedra • Cauchy to Sabitov (to an Open Problem) • Cauchy’s Rigidity Theorem • Aleksandrov’s Theorem • Sabitov’s Algorithm

  3. Reconstruction of Convex Polyhedra • graph • face angles • edge lengths • face areas • face normals • dihedral angles • inscribed/circumscribed Steinitz’s Theorem } Minkowski’s Theorem

  4. Minkowski’s Theorem

  5. Reconstruction of Convex Polyhedra • graph • face angles • edge lengths • face areas • face normals • dihedral angles • inscribed/circumscribed } Cauchy’s Theorem

  6. Cauchy’s Rigidity Theorem • If two closed, convex polyhedra are combinatorially equivalent, with corresponding faces congruent, then the polyhedra are congruent; • in particular, the dihedral angles at each edge are the same. Global rigidity == unique realization

  7. Same facial structure,noncongruent polyhedra

  8. Spherical polygon

  9. Sign Labels: {+,-,0} • Compare spherical polygons Q to Q’ • Mark vertices according to dihedral angles: {+,-,0}. Lemma: The total number of alternations in sign around the boundary of Q is ≥ 4.

  10. The spherical polygon opens. (a) Zero sign alternations; (b) Two sign alts.

  11. Sign changes  Euler Theorem Contradiction Lemma  ≥ 4 V

  12. Flexing top of regular octahedron

More Related