126 search results - page 6 / 26 » Self-improving algorithms for delaunay triangulations |
141
Voted
COMPGEOM
2005
ACM
15 years 3 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...
141
click to vote
SGP
2007
15 years 4 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...
124
click to vote
NOSSDAV
2009
Springer
15 years 8 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...
121
Voted
ALGORITHMICA
1998
15 years 1 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...
153
click to vote
VIS
2004
IEEE
16 years 3 months 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...