Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Rigidity of Frameworks Supported on Surfaces (1009.3772v2)

Published 20 Sep 2010 in math.CO and math.MG

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.

Summary

We haven't generated a summary for this paper yet.