Browsing SGP13: Eurographics Symposium on Geometry Processing (CGF 32-5) by Subject "Analysis of algorithms and problem complexity [F.2.2]"
Now showing items 1-1 of 1
-
Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions
(The Eurographics Association and Blackwell Publishing Ltd., 2013)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, ...