Sciweavers

COMGEO
2008
ACM

Optimal core-sets for balls

13 years 11 months ago
Optimal core-sets for balls
Given a set of points P Rd and value > 0, an -core-set S P has the property that the smallest ball containing S is within of the smallest ball containing P. This paper shows that any point set has an -core-set of size 1/ , and this bound is tight in the worst case. Some experimental results are also given, comparing this algorithm with a previous one, and with a more powerful, but slower one.
Mihai Badoiu, Kenneth L. Clarkson
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where COMGEO
Authors Mihai Badoiu, Kenneth L. Clarkson
Comments (0)