On Generic Rigidity in the Plane

DOI10.1137/0603009zbMATH Open0497.05025OpenAlexW2088062469MaRDI QIDQ3960720FDOQ3960720

Authors: Yechiam Yemini, László Lovász 

Publication date: 1982

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0603009

zbMATH Keywords

rigid motiongeneric degree of freedompoints are algebraically independent

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)

Cites Work

• On graphs and rigidity of plane skeletal structures
• Decomposition of Finite Graphs Into Forests
• The Rigidity of Graphs
• Minimum partition of a matroid into independent subsets
• The rigidity of graphs. II
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (87)

• The number of realizations of a Laman graph
• Maxwell-independence: a new rank estimate for the 3-dimensional generic rigidity matroid
• Packing of rigid spanning subgraphs and spanning trees
• Flexible circuits in the d‐dimensional rigidity matroid
• Generically globally rigid zeolites in the plane
• Boundedness, rigidity and global rigidity of direction-length frameworks
• Tensegrity frameworks in one-dimensional space
• A characterisation of the generic rigidity of 2-dimensional point-line frameworks
• A network theory approach to the rigidity of skeletal structures. II: Laman's theorem and topological formulae
• Symmetric versions of Laman's theorem
• Bounded direction-length frameworks
• A sufficient connectivity condition for generic rigidity in the plane
• On the two-dimensional generic rigidity matroid and its dual
• Pin-collinear body-and-pin frameworks and the molecular conjecture
• The parity problem of polymatroids without double circuits
• Globally rigid circuits of the direction-length rigidity matroid
• Equivalent realisations of a rigid graph
• Cuts, matrix completions and graph rigidity
• Highly connected molecular graphs are rigid in three dimensions
• Graph rigidity via Euclidean distance matrices
• An algorithm for two-dimensional rigidity percolation: The pebble game
• Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
• Algebraic matroids in action
• Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials
• A combinatorial study of the rigidity of planar structures
• Forests, frames, and games: Algorithms for matroid sums and applications
• Efficient computation of implicit representations of sparse graphs
• Symmetric isostatic frameworks with \(\ell^1\) or \(\ell^\infty\) distance constraints
• Connected rigidity matroids and unique realizations of graphs
• Infinitesimal Rigidity in Normed Planes
• Operations preserving global rigidity of generic direction-length frameworks
• \(k\)-plane matroids and Whiteley's flattening conjectures
• Slider-pinning rigidity: a Maxwell-Laman-type theorem
• Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs
• Bending of surfaces. II
• Source location with rigidity and tree packing requirements
• Generalized polymatroids and submodular flows
• The Dress conjectures on rank in the 3-dimensional rigidity matroid
• A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\)
• The \(d\)-dimensional rigidity matroid of sparse graphs
• Sparse hypergraphs and pebble game algorithms
• On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
• Coincident rigidity of 2-dimensional frameworks
• Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups
• Pebble game algorithms and sparse graphs
• Detecting All Dependences in Systems of Geometric Constraints Using the Witness Method
• On combinatorial structures of line drawings of polyhedra
• Rigid two-dimensional frameworks with two coincident points
• Maxwell-Laman counts for bar-joint frameworks in normed spaces
• Singular spaces of matrices and their application in combinatorics
• Isostatic bar and joint frameworks in the plane with irreducible pure conditions
• Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—
• ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID
• Minimally globally rigid graphs
• On characterizations of rigid graphs in the plane using spanning trees
• Matroids of gain graphs in applied discrete geometry
• Metric graphs elastically embeddable in the plane
• Applications of combinatorics to statics --- a second survey
• Sufficient connectivity conditions for rigidity of symmetric frameworks
• Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
• A network theory approach to the rigidity of skeletal structures. I: Modelling and interconnection
• Rigidity, global rigidity, and graph decomposition
• Sparse hypergraphs with applications in combinatorial rigidity
• Spectral conditions for graph rigidity in the Euclidean plane
• DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
• Graph rigidity for unitarily invariant matrix norms
• Graph rigidity properties of Ramanujan graphs
• Searching the solution space in constructive geometric constraint solving with genetic algorithms
• Rigid two-dimensional frameworks with three collinear points
• Graph transformations for efficient structural analysis
• Spectral radius conditions for the rigidity of graphs
• The reachability problem in constructive geometric constraint solving based dynamic geometry
• Matroid matching with Dilworth truncation
• Graph reconstruction from unlabeled edge lengths
• Sufficient conditions for 2-dimensional global rigidity
• Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane
• Extremal graphs for a spectral inequality on edge-disjoint spanning trees
• Generic symmetry-forced infinitesimal rigidity: translations and rotations
• Count and cofactor matroids of highly connected graphs
• Subspace arrangements, graph rigidity and derandomization through submodular optimization
• Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs
• Sharp threshold for rigidity of random graphs
• Frameworks with Coordinated Edge Motions
• On the generic rigidity of bar-frameworks
• Rigidity of frameworks on expanding spheres
• On the robustness to multiple agent losses in 2D and 3D formations
• Spanning Rigid Subgraph Packing and Sparse Subgraph Covering

This page was built for publication: On Generic Rigidity in the Plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3960720)