2000 character limit reached
Rigidity of Frameworks Supported on Surfaces
Published 20 Sep 2010 in math.CO and math.MG | (1009.3772v2)
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 $\bR2$. A more general theory is developed for frameworks in $\bR3$ 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.