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