arXiv · math/0301333
A rigidity criterion for non-convex polyhedra
Abstract
Let $P$ be a (non necessarily convex) embedded polyhedron in $\R^3$, with its vertices on an ellipsoid. Suppose that the interior of $P$ can be decomposed into convex polytopes without adding any vertex. Then $P$ is infinitesimally rigid. More generally, let $P$ be a polyhedron bounding a domain which is the union of polytopes $C_1, ..., C_n$ with disjoint interiors, whose vertices are the vertices of $P$. Suppose that there exists an ellipsoid which contains no vertex of $P$ but intersects all the edges of the $C_i$. Then $P$ is infinitesimally rigid. The proof is based on some geometric properties of hyperideal hyperbolic polyhedra.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jean-Marc Schlenker. 2003-01-30. A rigidity criterion for non-convex polyhedra. https://arxiv.org/abs/math/0301333
Cite the original work for its findings. Save a collection to share your selection of sources.