This paper proves that for any dimension d, the number of equivalent d-dimensional Euclidean realisations cd(G) of a rigid graph G is always less than or equal to the number of equivalent d-dimensional spherical realisations c*d(G). The key technique involves coning, adding a vertex adjacent to all others, which relates cd and c*d. Overall the work confirms cd(G) ≤ c*d(...