On the existence of two affine-equivalent frameworks with prescribed edge lengths in Euclidean $d$-space

We study the existence of the two affine-equivalent bar-and-joint frameworks in Euclidean $d$-space which have some prescribed combinatorial structure and edge lengths. We show that the existence problem is always solvable theoretically and explain why to propose a practical algorithm for solving the problem is impossible.