1082 search results - page 142 / 217 » Approximation Algorithms for Spreading Points |
SODA
2004
ACM
13 years 10 months ago
2004
ACM
For a rectilinear Steiner tree T with a root, define its k-th moment Mk(T) = T (dT (u))k du, where the integration is over all edges of T, dT (u) is the length of the unique path ...
SMA
2010
ACM
13 years 9 months ago
2010
ACM
Extremal surfaces are a class of implicit surfaces that have been found useful in a variety of geometry reconstruction applications. Compared to iso-surfaces, extremal surfaces ar...
JGTOOLS
2006
13 years 9 months ago
2006
Poisson Disk sampling patterns are of interest to the graphics community because their blue-noise properties are desirable in sampling patterns for rendering, illumination, and ot...
AAECC
2005
Springer
13 years 9 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
NJC
2000
13 years 9 months ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...