45 search results - page 8 / 9 » compgeom 2006 |
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
In the last decade, a great deal of work has been devoted to the elaboration of a sampling theory for smooth surfaces. The goal was to ensure a good reconstruction of a given surf...
COMPGEOM
2006
ACM
13 years 9 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...