Globally rigid graphs are fully reconstructible

Dániel Garamvölgyi, Steven J. Gortler, Tibor Jordán

A $d$-dimensional framework is a pair $(G,p)$, where $G=(V,E)$ is a graph and $p$ is a map from $V$ to ${\mathbb{R}}^d$. The length of an edge $uv\in E$ in $(G,p)$ is the distance be…