Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA characterisation of generically rigid frameworks on surfaces of revolution
124
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
A foundational theorem of Laman provides a counting characterisation of the finite simple graphs whose generic bar-joint frameworks in two dimensions are infinitesimally rigid. Recently a Laman-type characterisation 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-Henneberg 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 characterisation 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.
rate research
Read More
A 2-dimensional point-line framework is a collection of points and lines in the plane which are linked by pairwise constraints that fix some angles between pairs of lines and also some point-line and point-point distances. It is rigid if every continuous motion of the points and lines which preserves the constraints results in a point-line framework which can be obtained from the initial framework by a translation or a rotation. We characterise when a generic point-line framework is rigid. Our characterisation gives rise to a polynomial algorithm for solving this decision problem.
Combinatorial characterisations are obtained of symmetric and anti-symmetric infinitesimal rigidity for two-dimensional frameworks with reflectional symmetry in the case of norms where the unit ball is a quadrilateral and where the reflection acts freely on the vertex set. At the framework level, these characterisations are given in terms of induced monochrome subgraph decompositions, and at the graph level they are given in terms of sparsity counts and recursive construction sequences for the corresponding signed quotient graphs.
We develop a combinatorial rigidity theory for symmetric bar-joint frameworks in a general finite dimensional normed space. In the case of rotational symmetry, matroidal Maxwell-type sparsity counts are identified for a large class of $d$-dimensional normed spaces (including all $ell^p$ spaces with $p ot=2$). Complete combinatorial characterisations are obtained for half-turn rotation in the $ell^1$ and $ell^infty$-plane. As a key tool, a new Henneberg-type inductive construction is developed for the matroidal class of $(2,2,0)$-gain-tight graphs.
Define the augmented square twist origami crease pattern to be the classic square twist crease pattern with one crease added along a diagonal of the twisted square. In this paper we fully describe the rigid foldability of this new crease pattern. Specifically, the extra crease allows the square twist to rigidly fold in ways the original cannot. We prove that there are exactly four non-degenerate rigid foldings of this crease pattern from the unfolded state.
A rigidity theory is developed for frameworks in a metric space with two types of distance constraints. Mixed sparsity graph characterisations are obtained for the infinitesimal and continuous rigidity of completely regular bar-joint frameworks in a variety of such contexts. The main results are combinatorial characterisations for (i) frameworks restricted to surfaces with both Euclidean and geodesic distance constraints, (ii) frameworks in the plane with Euclidean and non-Euclidean distance constraints, and (iii) direction-length frameworks in the non-Euclidean plane.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
