On Generic Rigidity in the Plane
From MaRDI portal
Publication:3960720
DOI10.1137/0603009zbMath0497.05025MaRDI 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
Detecting All Dependences in Systems of Geometric Constraints Using the Witness Method, A combinatorial study of the rigidity of planar structures, Symmetric versions of Laman's theorem, Slider-pinning rigidity: a Maxwell-Laman-type theorem, 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, Source location with rigidity and tree packing requirements, Pin-collinear body-and-pin frameworks and the molecular conjecture, Globally rigid circuits of the direction-length rigidity matroid, Tensegrity frameworks in one-dimensional space, Rigidity, global rigidity, and graph decomposition, The parity problem of polymatroids without double circuits, 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, Detection of structural inconsistency in systems of equations with degrees of freedom and its applications, Generalized polymatroids and submodular flows, On the two-dimensional generic rigidity matroid and its dual, Forests, frames, and games: Algorithms for matroid sums and applications, Applications of combinatorics to statics --- a second survey, Isostatic bar and joint frameworks in the plane with irreducible pure conditions, Metric graphs elastically embeddable in the plane, Cuts, matrix completions and graph rigidity, An algorithm for two-dimensional rigidity percolation: The pebble game, Efficient computation of implicit representations of sparse graphs, Connected rigidity matroids and unique realizations of graphs, On the generic rigidity of bar-frameworks, Bending of surfaces. II, Graph rigidity via Euclidean distance matrices, On combinatorial structures of line drawings of polyhedra, Matroid matching with Dilworth truncation, Pebble game algorithms and sparse graphs, The Dress conjectures on rank in the 3-dimensional rigidity matroid, Rigid two-dimensional frameworks with three collinear points, The \(d\)-dimensional rigidity matroid of sparse graphs, On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs, Searching the solution space in constructive geometric constraint solving with genetic algorithms, OPERATIONS PRESERVING GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS, DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY, ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID, Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—, Singular spaces of matrices and their application in combinatorics
Cites Work
