We present the $O(n^2)$-time algorithm of Georgakopoulos and Papadimitriou for finding the point on the plane which, if added to a given set of $n$ points, will result in the shortest possible spanning tree.