Combinatorial genericity and minimal rigidity

DOI10.1145/1377676.1377738MaRDI QIDQ3602936zbMATH OpenOpenAlexFDO

Authors 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.1377738

zbMATH Keywords

genericitycombinatorial proof of Laman's theorem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Structural characterization of families of graphs (05C75) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Recommendations

• Rigidity Matroids
• Generic global rigidity
• Generic combinatorial rigidity of periodic frameworks
• Characterizing generic global rigidity
• Rigidity of Frameworks Supported on Surfaces

Cited in

(8)

• Graphs with flexible labelings
• Mixed volume techniques for embeddings of Laman graphs
• Generic unlabeled global rigidity
• The non-solvability by radicals of generic 3-connected planar Laman graphs
• Sparsity-certifying graph decompositions
• Epsilon local rigidity and numerical algebraic geometry
• Combinatorial models of rigidity and renormalization
• Analyzing rigidity with pebble games

This page was built for publication: Combinatorial genericity and minimal rigidity

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