Tetrahedron Model Reconstruction and Optimization

Three dimensional geometric modeling plays an important role in virtual surgery simulation. One of difficulties is how to construct well-shaped tetrahedral models. Delaunay tetrahedral reconstruction is an effective method in virtual surgery simulations. However, it is difficult to satisfy the quality requirements of the finite element method because of the bad shaped elements existed. This paper describes a method to construct quality 3D tetrahedral model directly from surface mesh, and a new hybrid sliver-element elimination method for Delaunay tetrahedral is proposed in this paper. Numerical examples are provided to demonstrate the effectiveness of the algorithm. The experimental results show that the tetrahedron model reconstruction method can improve the quality and solve the missing boundary problem, and the Delaunay tetrahedral sliver element elimination method can not only maintain the geometry shape of original model, but also solve the randomness problem for point selecting in Delaunay refinement method.

[1]  Pierre Alliez,et al.  Interleaving Delaunay refinement and optimization for practical isotropic tetrahedron mesh generation , 2009, ACM Trans. Graph..

[2]  Kokichi Sugihara.  Sliver-free perturbation for the Delaunay tetrahedrization , 2007, Comput. Aided Des..

[3]  Shang-Hua Teng,et al.  Sliver-free three dimensional delaunay mesh generation , 2001 .

[4]  D. F. Watson.  Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..

[5]  Laurent Rineau,et al.  Meshing 3D Domains Bounded by Piecewise Smooth Surfaces* , 2007, IMR.

[6]  Xiang-Yang Li,et al.  Generating well-shaped Delaunay meshed in 3D , 2001, SODA '01.

[7]  William H. Frey,et al.  An apporach to automatic three‐dimensional finite element mesh generation , 1985 .

[8]  Robin Sibson,et al.  Computing Dirichlet Tessellations in the Plane , 1978, Comput. J..

[9]  Herbert Edelsbrunner,et al.  Sliver exudation , 2000, J. ACM.

[10]  Adrian Bowyer,et al.  Computing Dirichlet Tessellations , 1981, Comput. J..

[11]  Q. Du,et al.  Boundary recovery for three dimensional conforming Delaunay triangulation , 2004 .

[12]  L. Paul Chew,et al.  Guaranteed-quality Delaunay meshing in 3D (short version) , 1997, SCG '97.

[13]  Qiang Du,et al.  Constrained boundary recovery for three dimensional Delaunay triangulations , 2004 .

[14]  Scott A. Mitchell,et al.  Quality mesh generation in three dimensions , 1992, SCG '92.

[15]  Mark S. Shephard,et al.  Triangulation of arbitrary polyhedra to support automatic mesh generators , 2000 .

[16]  Xiang-Yang Li.  Generating well-shaped d-dimensional Delaunay Meshes , 2003, Theor. Comput. Sci..

[17]  Pierre Alliez,et al.  Perturbing Slivers in 3D Delaunay Meshes , 2009, IMR.

[18]  Jonathan Richard Shewchuk,et al.  Tetrahedral mesh generation by Delaunay refinement , 1998, SCG '98.

[19]  Xu Yong-an,et al.  The Algorithm of 3D Constrained Delaunay Triangulation , 2001 .

[20]  François Labelle,et al.  Sliver removal by lattice refinement , 2006, SCG '06.

[21]  P. George,et al.  Automatic mesh generator with specified boundary , 1991 .

[22]  Yang Qin.  Research on 3D Constrained Delaunay Triangulation , 2000 .

[23]  Q. Du,et al.  Recent progress in robust and quality Delaunay mesh generation , 2006 .

[24]  Herbert Edelsbrunner,et al.  Sliver exudation , 1999, SCG '99.