On the infinitesimal rigidity of weakly convex polyhedra
classification
🧮 math.DG
keywords
convexpolyhedronpolyhedravertexaddingcaseclassescommon
read the original abstract
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex polyhedron, is infinitesimally rigid. We prove that it is indeed the case for two classes of polyhedra: those obtained from a convex polyhedron by ``denting'' at most two edges at a common vertex, and suspensions with a natural subdivision.
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.