SIAM Journal on Discrete Mathematics · 2012 · 66 citations · 21 references
Natural SciencesMathematicsCombinatoricsComputational GeometryTopologyConvex GeometryGeometric ConstraintsGeometric GraphsGeometric TopologyLow-dimensional GeometryMetric GeometryCombinatorial RepresentationsFramework RigidityGeometric Structures On ManifoldsIntersections Of Parallel PlanesRigidity TheoryStructural Rigidity
A theorem of Laman gives a combinatorial characterization of the graphs that admit a realization as a minimally rigid generic bar-joint framework in $\mathbb{R}^2$. A more general theory is developed for frameworks in $\mathbb{R}^3$ whose vertices are constrained to move on a two-dimensional smooth submanifold $\mathcal{M}$. Furthermore, when $\mathcal{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.
21
On graphs and rigidity of plane skeletal structures
G. Laman · Journal of Engineering Mathematics · 1970 · 1.1K citations