pith. sign in

arxiv: math/0301333 · v2 · submitted 2003-01-28 · 🧮 math.DG · math.MG

A rigidity criterion for non-convex polyhedra

classification 🧮 math.DG math.MG
keywords verticesconvexellipsoidinfinitesimallypolyhedrapolyhedronpolytopesrigid
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.