Sciweavers

947 search results - page 138 / 190
» Discrete Geometry
Sort
View
COMPGEOM
2006
ACM
15 years 3 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
15 years 3 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
15 years 3 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
15 years 3 months ago
How to get close to the median shape
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...
Sariel Har-Peled
COMPGEOM
2006
ACM
15 years 3 months ago
Refolding planar polygons
Abstract This paper describes an algorithm for generating a guaranteed intersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prio...
Hayley N. Iben, James F. O'Brien, Erik D. Demaine