An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points.

Robert L. Scot Drysdale Asish Mukhopadhyay An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points. 47-51 2008 105 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2007.08.004 db/journals/ipl/ipl105.html#DrysdaleM08