Near-linear algorithm for the planar 2-center problem

Research output: Contribution to conferencePaperpeer-review

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 [9].

Original languageEnglish
Pages106-112
Number of pages7
StatePublished - 1996
EventProceedings of the 1996 12th Annual Symposium on Computational Geometry - Philadelphia, PA, USA
Duration: 24 May 199626 May 1996

Conference

ConferenceProceedings of the 1996 12th Annual Symposium on Computational Geometry
CityPhiladelphia, PA, USA
Period24/05/9626/05/96

Fingerprint

Dive into the research topics of 'Near-linear algorithm for the planar 2-center problem'. Together they form a unique fingerprint.

Cite this