503 search results - page 5 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
CCCG
2010
14 years 11 months ago
2010
We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vector...
CCCG
2009
14 years 7 months ago
2009
We study the 1-center problem with outliers in highdimensional data streams. The problem definition is as follows: given a sequence of n points in d dimensions (with d arbitrarily...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
We present a new streaming algorithm for maintaining an -kernel of a point set in Rd using O((1/(d-1)/2 ) log(1/)) space. The space used by our algorithm is optimal up to a small ...
81
Voted
COCOON
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
TCS
2008
14 years 9 months ago
2008
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...