126 search results - page 6 / 26 » Self-improving algorithms for delaunay triangulations |
121
click to vote
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
120
Voted
SGP
2007
15 years 2 months ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
103
click to vote
NOSSDAV
2009
Springer
15 years 6 months ago
2009
Springer
This article proposes a new distributed architecture for update message exchange in massively multi-user virtual environments (MMVE). MMVE applications require delivery of updates...
103
click to vote
ALGORITHMICA
1998
14 years 11 months ago
1998
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
131
Voted
VIS
2004
IEEE
16 years 25 days ago
2004
IEEE
We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solv...