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. Inf. Process. Lett., 105(2):47-51, 2008. [doi]

Abstract

Abstract is missing.