126 search results - page 2 / 26 » Self-improving algorithms for delaunay triangulations |
116
click to vote
SMI
2007
IEEE
15 years 8 months ago
2007
IEEE
We present an isosurface meshing algorithm, DELISO, based on the Delaunay refinement paradigm. This paradigm has been successfully applied to mesh a variety of domains with guara...
134
Voted
COMPGEOM
2000
ACM
15 years 6 months ago
2000
ACM
For a sufficiently dense set of points in any closed Riemannian manifold, we prove that a unique Delannay triangulation exists. This triangulation has the same properties as in Eu...
103
Voted
SODA
2003
ACM
15 years 3 months ago
2003
ACM
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still ...
105
click to vote
WADS
2001
Springer
15 years 6 months ago
2001
Springer
In this paper we discuss the kinetic maintenance of the Euclidean Voronoi diagram and its dual, the Delaunay triangulation, for a set of moving disks. The most important aspect in ...
127
Voted
ISCSCT
2008
IEEE
15 years 8 months ago
2008
IEEE
—In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by m...