123 search results - page 2 / 25 » Delaunay Meshing of Isosurfaces |
EWC
2002
13 years 4 months ago
2002
We present results on a two-step improvement of mesh quality in three-dimensional Delaunay triangulations. The first step refines the triangulation by inserting sinks and eliminate...
VIS
2004
IEEE
14 years 6 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...
11
Voted
COMGEO
2006
ACM
13 years 4 months ago
2006
ACM
Let P be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of P with bounded vertex degree is within a factor O(H3 P ) of the size of any Dela...
CGF
2010
13 years 5 months ago
2010
The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one la...
CG
2005
Springer
13 years 4 months ago
2005
Springer
An unstructured tetrahedral mesh generation algorithm for 3D model with constraints is presented. To automatically generate a tetrahedral mesh for model with constraints, an advan...