Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions
In this paper, an algorithm is introduced that computes an arbitrarily fine approximation of the smallest enclosing ball of a point set in any dimension. This operation is important in, for example, classification, clustering, and data mining. The algorithm is very simple to implement, gives reliable results, and gracefully handles large problem instances in low and high dimensions, as confirmed by both theoretical arguments and empirical evaluation. For example, using a CPU with eight cores, it takes less than two seconds to compute a 1.001-approximation of the smallest enclosing ball of one million points uniformly distributed in a hypercube in dimension 200. Furthermore, the presented approach extends to a more general class of input objects, such as ball sets.
computer graphics [i 3 5]: computational geometry and object modelinggeometric algorithms languages and systems analysis of algorithms and problem complexity [f 2 2]: nonnumerical algorithms and problemsgeometrical problems and computations