An Algorithm of Generating Unstructured Tetrahedrons from 3D Discrete Points

Delaunay tetrahedron generation is one of the important techniques to construct surface mesh using three dimensional discrete points.Because it is a common case of the inconsistent tetrahedrons in the algorithm of locally constructing the Delaunay tetrahedron based on the principle of triangular meshes eduction,this paper presents a novel Delaunay tetrahedralization scheme to solve this problem.During the procedure of constructing the Delaunay tetrahedron,not only the tetrahedrons totally constructed before the local computing of the current points are utilized,but also the tetrahedrons constructed during the local computing of the current points are considered as the boundary information.Therefore the consistent compatibility of making tetrahedrons is improved.At the end of this paper,several experiments are given to show that the proposed algorithm is efficient.