Abstract A d -dimensional framework is a pair $(G,p)$ , where $G=(V,E)$ graph and p map from V to $\mathbb {R}^d$ . The length of an edge $uv\in E$ in the distance between $p(u)$ $p(v)$ said be globally rigid if G its lengths uniquely determine up congruence. called every generic rigid. In this paper, we consider problem reconstructing set arising framework. Roughly speaking, strongly reconstru...