Sciweavers

37 search results - page 2 / 8
» Smallest Enclosing Cylinders
Sort
View
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
15 years 11 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
COMPGEOM
2003
ACM
15 years 11 months ago
The smallest enclosing ball of balls: combinatorial structure and algorithms
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Kaspar Fischer, Bernd Gärtner
ECML
2005
Springer
15 years 11 months ago
Fitting the Smallest Enclosing Bregman Ball
Finding a point which minimizes the maximal distortion with respect to a dataset is an important estimation problem that has recently received growing attentions in machine learnin...
Richard Nock, Frank Nielsen
133
Voted
COMPGEOM
2006
ACM
15 years 12 months ago
On approximating the smallest enclosing Bregman Balls
Frank Nielsen, Richard Nock
COMPGEOM
1997
ACM
15 years 10 months ago
Exact Primitives for Smallest Enclosing Ellipses
Bernd Gärtner, Sven Schönherr