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.

• Type: Journal
• Year: 2008
• Where: COMGEO
• Authors: Mihai Badoiu, Kenneth L. Clarkson
• Keywords: Applied Computing, COMGEO 2008, Paper, Smallest Ball, Worst Case