A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
The number of embeddings of minimally rigid graphs in R D is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap between upper and lower bounds is still enormous. Specific values and its asymptotic behavior are major and fascinating open problems in rigidity theory. Our work considers the maximal number of real embeddings of minimally rigid graphs in R 3 . We modify a commonlydoi:10.1145/3208976.3208994 dblp:conf/issac/BartzosELT18 fatcat:upf4d2byqzfkfcm54yr5qb6pqu