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.
1 January 2014 in SIAM Journal on Discrete Mathematics
A foundational theorem of Laman provides a counting characterization of the finite simple graphs whose generic bar-joint frameworks in two dimensions are infinitesimally rigid. Recently a Laman-type characterization was obtained for frameworks in three dimensions whose vertices are constrained to concentric spheres or to concentric cylinders. Noting that the plane and the sphere have 3 independent locally tangential infinitesimal motions while the cylinder has 2, we obtain here a Laman-type theorem for frameworks on algebraic surfaces with a 1-dimensional space of tangential motions. Such surfaces include the torus, helicoids, and surfaces of revolution. The relevant class of graphs are the (2,1)-tight graphs, in contrast to (2,3)-tightness for the plane/sphere and (2,2)-tightness for the cylinder. The proof uses a new characterization of simple (2,1)-tight graphs and an inductive construction requiring generic rigidity preservation for 5 graph moves, including the two Henneberg moves, an edge joining move, and various vertex surgery moves.
1 March 2019 in Journal of Combinatorial Theory, Series B
Finite pieces of locally isostatic networks have a large number of floppy modes because of missing constraints at the surface. Here we show that by imposing suitable boundary conditions at the surface the network can be rendered effectively isostatic. We refer to these as anchored boundary conditions. An important example is formed by a two-dimensional network of corner sharing triangles, which is the focus of this paper. Another way of rendering such networks isostatic is by adding an external wire along which all unpinned vertices can slide (sliding boundary conditions). This approach also allows for the incorporation of boundaries associated with internal holes and complex sample geometries, which are illustrated with examples. The recent synthesis of bilayers of vitreous silica has provided impetus for this work. Experimental results from the imaging of finite pieces at the atomic level need such boundary conditions, if the observed structure is to be computer refined so that the interior atoms have the perception of being in an infinite isostatic environment.
In this paper, we offer an overview of a number of results on the static rigidity and infinitesimal rigidity of discrete structures which are embedded in projective geometric reasoning, representations, and transformations. Part I considers the fundamental case of a bar–joint framework in projective d-space and places particular emphasis on the projective invariance of infinitesimal rigidity, coning between dimensions, transfer to the spherical metric, slide joints and pure conditions for singular configurations. Part II extends the results, tools and concepts from Part I to additional types of rigid structures including body-bar, body–hinge and rod-bar frameworks, all drawing on projective representations, transformations and insights. Part III widens the lens to include the closely related cofactor matroids arising from multivariate splines, which also exhibit the projective invariance. These are another fundamental example of abstract rigidity matroids with deep analogies to rigidity. We conclude in Part IV with commentary on some nearby areas.