On the infinitesimal rigidity of polyhedra with vertices in convex position

preprint2007arXivOpen access

Abstract

Let P⊂R3P \subset \R^3 be a polyhedron. It was conjectured that if PP is weakly convex (i. e. its vertices lie on the boundary of a strictly convex domain) and decomposable (i. e. PP can be triangulated without adding new vertices), then it is infinitesimally rigid. We prove this conjecture under a weak additional assumption of codecomposability. The proof relies on a result of independent interest concerning the Hilbert-Einstein function of a triangulated convex polyhedron. We determine the signature of the Hessian of that function with respect to deformations of the interior edges. In particular, if there are no interior vertices, then the Hessian is negative definite.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.