Rigidity of Frameworks Supported on Surfaces

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.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Tiong-Seng Tay,et al.  Henneberg's Method for Bar and Body Frameworks , 1991 .

[3]  Tibor Jordán,et al.  A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid , 2003, J. Comb. Theory, Ser. B.

[4]  J. C. Owen,et al.  The non-solvability by radicals of generic 3-connected planar Laman graphs , 2006 .

[5]  Bernd Schulze,et al.  Coning, Symmetry and Spherical Frameworks , 2011, Discret. Comput. Geom..

[6]  Bill Jackson,et al.  Egerváry Research Group on Combinatorial Optimization Connected Rigidity Matroids and Unique Realizations of Graphs Connected Rigidity Matroids and Unique Realizations of Graphs , 2022 .

[7]  B. Jackson.  Notes on the Rigidity of Graphs , 2007 .

[8]  C. Nash-Williams.  Edge-disjoint spanning trees of finite graphs , 1961 .

[9]  A. Recski.  A Network Theory Approach to the Rigidity of Skeletal Structures.Part III. An Electric Model of Planar Frameworks , 1984 .

[10]  H. Gluck.  Almost all simply connected closed surfaces are rigid , 1975 .

[11]  András Recski,et al.  A network theory approach to the rigidity of skeletal structures part II. Laman's theorem and topological formulae , 1984, Discret. Appl. Math..

[12]  Anthony Nixon,et al.  An inductive construction of (2, 1)-tight graphs , 2011, Contributions Discret. Math..

[13]  B. Roth,et al.  The rigidity of graphs , 1978 .

[14]  J. C. Owen,et al.  Frameworks Symmetry and Rigidity , 2008, Int. J. Comput. Geom. Appl..

[15]  B. Roth,et al.  The rigidity of graphs, II , 1979 .

[16]  Walter Whiteley,et al.  Cones, infinity and one-story buildings , 1983 .

[17]  Robert Connelly,et al.  Global Rigidity: The Effect of Coning , 2010, Discret. Comput. Geom..

[18]  Audrey Lee-St. John,et al.  Pebble game algorithms and sparse graphs , 2007, Discret. Math..

[19]  Michael Emile Hermary.  Rigidity of graphs , 1986 .

[20]  L. Lovász,et al.  On Generic Rigidity in the Plane , 1982 .

[21]  Anthony Nixon,et al.  A LAMAN THEOREM FOR FRAMEWORKS ON SURFACES OF REVOLUTION , 2013 .

[22]  Walter Whiteley,et al.  The Union of Matroids and the Rigidity of Frameworks , 1988, SIAM J. Discret. Math..

[23]  Günter Rote,et al.  Planar minimally rigid graphs and pseudo-triangulations , 2003, SCG '03.

[24]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[25]  G. Laman.  On graphs and rigidity of plane skeletal structures , 1970 .

[26]  A. Kempe.  On a General Method of describing Plane Curves of the nth degree by Linkwork , 1875 .

[27]  B. Hendrickson,et al.  Regular ArticleAn Algorithm for Two-Dimensional Rigidity Percolation: The Pebble Game , 1997 .

[28]  B. Roth.  Rigid and Flexible Frameworks , 1981 .