COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides,...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
The medial axis of a shape is known to carry a lot of information about it. In particular a recent result of Lieutier establishes that every bounded open subset of Rn has the same...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
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
This paper examines the computation of the Voronoi diagram of a set of ellipses in the Euclidean plane. We propose the first complete algorithms, under the exact computation para...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
We investigate a new class of geometric problems based on the idea of online error correction. Suppose one is given access to a large geometric dataset though a query mechanism; f...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
