On the number of embeddings of minimally rigid graphs

DOI10.1145/513400.513404zbMath1414.68111OpenAlexW2025334823MaRDI QIDQ4557533

Ileana Streinu, Ciprian S. Borcea

Publication date: 23 November 2018

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

Full work available at URL: https://scholarworks.smith.edu/csc_facpubs/17

zbMATH Keywords

upper boundrigiditydistance geometrylower boundgraph embeddingCayley-Menger variety

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs

This page was built for publication: On the number of embeddings of minimally rigid graphs