An algorithm of generating unstructured tetrahedron from 3D discrete points

Delaunay tetrahedron generation is one of the important techniques to construct surface mesh using 3D discrete points. Because there is a common seen case of the inconsistent tetrahedrons in the Delaunay triangulation algorithm based on local constructing with the recursion principle of triangular meshes. To solve the problem, this paper presents a novel Delaunay tetrahedralization scheme which considered both tetrahedrons constructed during the local computation of current point and those constructed before the local computation as constraint information in the procedure of constructing a new Delaunay tetrahedron. Therefore, the consistent compatibility of Delaunay tetaherdralization has been improved. At the end of this paper, several experiments are given to show that the proposed algorithm is more efficient.