most citedAn upper bound on Euclidean embeddings of rigid graphs with 8 vertices

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.CG2012★ 2 cited

An upper bound on Euclidean embeddings of rigid graphs with 8 vertices

Stylianos C. Despotakis, Ioannis Z. Emiris

A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in R^d in a finite number of distinct ways, modulo rigid tr…