205 search results - page 6 / 41 » On Deletion in Delaunay Triangulations |
SMI
2007
IEEE
15 years 4 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...
111
click to vote
COMPGEOM
2005
ACM
14 years 11 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...
CCCG
2009
14 years 11 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
COMPGEOM
2000
ACM
15 years 2 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...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, we propose a robust and efficient Lagrangian approach, which we call Delaunay Deformable Models, for modeling moving surfaces undergoing large deformations and topo...