A near-linear algorithm for the planar 2-center problem

Abstract

We present an O (n log9 n)-time algorithm for computing the 2-center of a set S of n points in the plane (that is, a pair of congruent disks of smallest radius whose union covers S), improving the previous O (n2 log n)-time algorithm of [10].