Sciweavers

COMPGEOM
2006
ACM
13 years 10 months ago
A sampling theory for compact sets in Euclidean space
Abstract We introduce a parameterized notion of feature size that interpolates between the minimum of the local feature size and the recently introduced weak feature size. Based on...
Frédéric Chazal, David Cohen-Steiner...
COMPGEOM
2006
ACM
13 years 10 months ago
Splitting (complicated) surfaces is hard
Erin W. Chambers, Éric Colin de Verdi&egrav...
COMPGEOM
2006
ACM
13 years 10 months ago
Provably good sampling and meshing of Lipschitz surfaces
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...
Jean-Daniel Boissonnat, Steve Oudot
COMPGEOM
2006
ACM
13 years 10 months ago
Engineering a compact parallel delaunay algorithm in 3D
We describe an implementation of a compact parallel algorithm for 3D Delaunay tetrahedralization on a 64-processor shared-memory machine. Our algorithm uses a concurrent version o...
Daniel K. Blandford, Guy E. Blelloch, Clemens Kado...
COMPGEOM
2006
ACM
13 years 10 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
COMPGEOM
2006
ACM
13 years 10 months ago
Embedding ultrametrics into low-dimensional spaces
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...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
COMPGEOM
2006
ACM
13 years 10 months ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii
COMPGEOM
2006
ACM
13 years 10 months ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...
COMPGEOM
2006
ACM
13 years 10 months ago
Complete subdivision algorithms, I: intersection of Bezier curves
We give the first complete subdivision algorithm for the intersection of two Bezier curves F, G, possibly with tangential intersections. Our approach to robust subdivision algori...
Chee-Keng Yap
COMPGEOM
2006
ACM
13 years 10 months ago
Minimum-cost load-balancing partitions
We consider the problem of balancing the load among m service-providing facilities, while keeping the total cost low. Let R be the underlying demand region, and let p1, . . . , pm...
Boris Aronov, Paz Carmi, Matthew J. Katz