Is sorting pairwise distances as hard as sorting arbitrary points?
This is an open question even for one-dimensional point sets.  In this setting, the distance-sorting problem is equivalent to sorting X+Y, where $X$ is the input set and $Y=-X$.