A rigidity criterion for non-convex polyhedra
微分几何
2007-05-23 v2 度量几何
摘要
Let be a (non necessarily convex) embedded polyhedron in , with its vertices on an ellipsoid. Suppose that the interior of can be decomposed into convex polytopes without adding any vertex. Then is infinitesimally rigid. More generally, let be a polyhedron bounding a domain which is the union of polytopes with disjoint interiors, whose vertices are the vertices of . Suppose that there exists an ellipsoid which contains no vertex of but intersects all the edges of the . Then is infinitesimally rigid. The proof is based on some geometric properties of hyperideal hyperbolic polyhedra.
引用
@article{arxiv.math/0301333,
title = {A rigidity criterion for non-convex polyhedra},
author = {Jean-Marc Schlenker},
journal= {arXiv preprint arXiv:math/0301333},
year = {2007}
}
备注
11 pages, 1 image. Revised versions will be posted on http://picard.ups-tlse.fr/~schlenker v2: one statement corrected, ref. added