A rigidity criterion for non-convex polyhedra - Université Toulouse III - Paul Sabatier - Toulouse INP Accéder directement au contenu
Article Dans Une Revue Discrete and Computational Geometry Année : 2005

A rigidity criterion for non-convex polyhedra

Résumé

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.

Dates et versions

hal-00113608 , version 1 (13-11-2006)

Identifiants

Citer

Jean-Marc Schlenker. A rigidity criterion for non-convex polyhedra. Discrete and Computational Geometry, 2005, 33, pp.207-221. ⟨hal-00113608⟩
19 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More