51 search results - page 2 / 11 » Fast Localized Delaunay Triangulation |
105
click to vote
SGP
2007
14 years 12 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...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
106
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...
101
click to vote
IJFCS
2002
14 years 9 months ago
2002
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
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...