Sciweavers

1419 search results - page 4 / 284
» A Characterization of Constructive Dimension
Sort
View
JAT
2006
82views more  JAT 2006»
13 years 7 months ago
Construction of recurrent bivariate fractal interpolation surfaces and computation of their box-counting dimension
Recurrent bivariate fractal interpolation surfaces (RBFISs) generalise the notion of affine fractal interpolation surfaces (FISs) in that the iterated system of transformations us...
P. Bouboulis, Leoni Dalla, V. Drakopoulos
COMPGEOM
2009
ACM
14 years 1 months ago
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
Jean-Daniel Boissonnat, Olivier Devillers, Samuel ...
COMPGEOM
1998
ACM
13 years 11 months ago
Constructing Approximate Shortest Path Maps in Three Dimensions
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
Sariel Har-Peled
STOC
1993
ACM
82views Algorithms» more  STOC 1993»
13 years 11 months ago
Efficient construction of a small hitting set for combinatorial rectangles in high dimension
Nathan Linial, Michael Luby, Michael E. Saks, Davi...