126 search results - page 3 / 26 » Self-improving algorithms for delaunay triangulations |
AMC
2005
14 years 9 months ago
2005
This paper investigates the implementation of a functional language algorithm for the divide-and-conquer Delaunay triangulation. The global aim is to improve its performance. Up t...
102
click to vote
COMGEO
2006
ACM
14 years 9 months ago
2006
ACM
: This note proposes a simple rule to determine a unique triangulation among all Delaunay triangulations of a planar point set, based on two preferred directions. We show that the ...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
97
Voted
COMPGEOM
2008
ACM
14 years 11 months ago
2008
ACM
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
100
click to vote
CPHYSICS
2004
14 years 9 months ago
2004
We describe algorithms to implement fully dynamic and kinetic three-dimensional unconstrained Delaunay triangulations, where the time evolution of the triangulation is not only go...