An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points.

Asish Mukhopadhyay Robert L. Scot Drysdale An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points. 2006 conf/cccg/2006 CCCG http://www.cs.queensu.ca/cccg/papers/cccg48.pdf db/conf/cccg/cccg2006.html#MukhopadhyayD06