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 .
|Number of pages||7|
|State||Published - 1996|
|Event||Proceedings of the 1996 12th Annual Symposium on Computational Geometry - Philadelphia, PA, USA|
Duration: 24 May 1996 → 26 May 1996
|Conference||Proceedings of the 1996 12th Annual Symposium on Computational Geometry|
|City||Philadelphia, PA, USA|
|Period||24/05/96 → 26/05/96|