Assuming you have a graph and know the distances between the points. You know that they can roughly be modeled as points on the 2D surface of a sphere by treating the distances as great-circle or orthodromic distances, but not quite.
How effectively could we use an euclidean N-D space to model great-circle distances?
I guess my question would be answered by a graph/chart that plots the deviation/error by distance and dimension.