pith. sign in

arxiv: 1009.3772 · v2 · pith:TZWACTD6new · submitted 2010-09-20 · 🧮 math.CO · math.MG

Rigidity of Frameworks Supported on Surfaces

classification 🧮 math.CO math.MG
keywords frameworksunioncombinatorialconcentricgenericrigidityadmitbar-joint
0
0 comments X
read the original abstract

A theorem of Laman gives a combinatorial characterisation of the graphs that admit a realisation as a minimally rigid generic bar-joint framework in $\bR^2$. A more general theory is developed for frameworks in $\bR^3$ whose vertices are constrained to move on a two-dimensional smooth submanifold $\M$. Furthermore, when $\M$ is a union of concentric spheres, or a union of parallel planes or a union of concentric cylinders, necessary and sufficient combinatorial conditions are obtained for the minimal rigidity of generic frameworks.

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.