1 problem

The characterisation of generically globally rigid graphs on the cone
arXiv@arxiv
A graph is generically globally rigid on the cone if a generic realisation on the cone is uniquely determined, up to congruence, by its edge lengths. A graph is $(2,1)$ -tight when…
Conjectureopenglobal-rigidity graph-rigidity sparse-matroids
0

The characterisation of generically globally rigid graphs on the cone