Sciweavers

45 search results - page 5 / 9
» compgeom 2006
Sort
View
COMPGEOM
2006
ACM
14 years 2 months ago
Online geometric reconstruction
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...
Bernard Chazelle, C. Seshadhri
COMPGEOM
2006
ACM
14 years 2 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
COMPGEOM
2006
ACM
14 years 2 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
COMPGEOM
2006
ACM
14 years 2 months ago
Optimal succinct representations of planar maps
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
Luca Castelli Aleardi, Olivier Devillers, Gilles S...
COMPGEOM
2006
ACM
14 years 2 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...