Analyzing rigidity with pebble games

DOI10.1145/1377676.1377715zbMATH Open1243.65034OpenAlexW2057653795MaRDI QIDQ3602920FDOQ3602920

Authors: Audrey Lee, Ileana Streinu, Louis Theran 

Publication date: 12 February 2009

Published in: Proceedings of the twenty-fourth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1377676.1377715

Recommendations

• An algorithm for two-dimensional rigidity percolation: The pebble game
• Combinatorial genericity and minimal rigidity
• An efficient algorithm for testing the generic rigidity of graphs in the plane
• Algorithms for graph rigidity and scene analysis
• A characterisation of the generic rigidity of 2-dimensional point-line frameworks

Mathematics Subject Classification ID

Applications of game theory (91A80) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cited In (2)

• The frictional pebble game: an algorithm for rigidity percolation in saturated frictional assemblies
• Sparsity-certifying graph decompositions

This page was built for publication: Analyzing rigidity with pebble games

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