  We study the problem of existence of two affine-equivalent bar-and-joint
frameworks in Euclidean $d$-space which have prescribed combinatorial structure
and edge lengths. We prove that theoretically this problem is always solvable,
but we cannot propose any practical algorithm for its solution.
