Near-linear algorithm for the planar 2-center problem

Micha Sharir

Near-linear algorithm for the planar 2-center problem

Micha Sharir^*

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to conference › Paper › peer-review

22 Scopus citations

Abstract

We present an O(n log⁹ 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(n² log n)-time algorithm of [9].

Original language	English
Pages	106-112
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

Conference	Proceedings of the 1996 12th Annual Symposium on Computational Geometry
City	Philadelphia, PA, USA
Period	24/05/96 → 26/05/96

Cite this

@conference{613028bbc16a4e7bb9843978896b9a09,

title = "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 [9].",

author = "Micha Sharir",

year = "1996",

language = "אנגלית",

pages = "106--112",

note = "Proceedings of the 1996 12th Annual Symposium on Computational Geometry ; Conference date: 24-05-1996 Through 26-05-1996",

}

TY - CONF

T1 - Near-linear algorithm for the planar 2-center problem

AU - Sharir, Micha

PY - 1996

Y1 - 1996

N2 - 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].

AB - 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].

UR - http://www.scopus.com/inward/record.url?scp=0029713034&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0029713034

SP - 106

EP - 112

T2 - Proceedings of the 1996 12th Annual Symposium on Computational Geometry

Y2 - 24 May 1996 through 26 May 1996

ER -

Near-linear algorithm for the planar 2-center problem

Abstract

Conference

Other files and links

Fingerprint

Cite this