208 search results - page 5 / 42 » Blocking delaunay triangulations |
SGP
2007
13 years 9 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...
PG
1997
IEEE
13 years 11 months ago
1997
IEEE
A view-dependent multiresolution triangulation algorithm is presented for a real-time flythrough. The triangulation of the terrain is generated incrementally onthe-fly during th...
COMPGEOM
2009
ACM
14 years 1 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 ...
CCCG
2003
13 years 8 months ago
2003
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common spher...
SMI
2007
IEEE
14 years 1 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...