An efficient algorithm for testing the generic rigidity of graphs in the plane

DOI10.1088/0305-4470/29/24/030zbMATH Open0902.60091OpenAlexW2087660534MaRDI QIDQ4394435FDOQ4394435

Authors: Cristian F. Moukarzel 

Publication date: 2 December 1998

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/0305-4470/29/24/030

Recommendations

• An algorithm for two-dimensional rigidity percolation: The pebble game
• Towards an optimal algorithm for recognizing Laman graphs
• Algorithms for graph rigidity and scene analysis
• Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs
• Generic rigidity in three-dimensional bond-bending networks

zbMATH Keywords

rigidity of graphsrescaling transformationrigidity in central-force systems

Mathematics Subject Classification ID

Other physical applications of random processes (60K40) Equilibrium statistical mechanics (82B99)

Cited In (16)

• Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
• The unassigned distance geometry problem
• An algorithm for an 𝓁²-homological test for the planarity of a graph
• An algorithm for two-dimensional rigidity percolation: The pebble game
• The frictional pebble game: an algorithm for rigidity percolation in saturated frictional assemblies
• Algorithms for graph rigidity and scene analysis
• Efficient algorithms for the \(d\)-dimensional rigidity matroid of sparse graphs
• The cavity method for the rigidity transition
• Epsilon local rigidity and numerical algebraic geometry
• Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
• Rigidity in glasses and proteins
• Towards an optimal algorithm for recognizing Laman graphs
• Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
• Generic rigidity in three-dimensional bond-bending networks
• Analyzing rigidity with pebble games
• Combinatorial models of rigidity and renormalization

This page was built for publication: An efficient algorithm for testing the generic rigidity of graphs in the plane

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