Combinatorial genericity and minimal rigidity

DOI10.1145/1377676.1377738zbMath1271.52018OpenAlexW1964888234MaRDI QIDQ3602936

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)

Related Items (3)

Graphs with flexible labelings ⋮ Mixed volume techniques for embeddings of Laman graphs ⋮ Sparsity-certifying graph decompositions

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