Study Of Three-dimensional Delaunay Trigulation Technology

In recent years,due to the rising of the computer industry,the requirements of the accuracy of large-scale engineering problems are increasingly high.In the process of building mathematical models,the griddind of the models is an essential precondition.The development speed of mesh generation technology is also accelerating.Delaunay unstructured grid has been widely used due to its good characteristics and becomes a hot topic in the mesh generation technology.Russian mathematician Delaunay first proposed the concept of Delaunay triangulation in 1934.After 80 years of development,the study of Delaunay mesh triangulation in two-dimensional domain has been basically completed,forming a relatively complete theoretical system.But there are some difficult issues about three-dimensional Delaunay triangulation,we should continue to study and propose solutions.This paper introduces the development process of Delaunay meshing technology,summarizes domestic and international two and three dimensional Delaunay mesh generation algorithms and categorizes them.Two major types of three dimensional representative algorithms are described in detail.It analyzes some optimization means in the construction of tetrahedral mesh cells process.This paper researchs on the specific implementation process of Delaunay angle criterion algorithm and puts forward a new Delaunay tetrahedral mesh generation algorithm in the convex hull of three-dimensional cospherical point set,named the minimum contiguous point deletion algorithm.Then this paper introduces the detailed implementation process of the algorithm and analyzes the advantages of it.The algorithm can be successfully applied in building Delaunay tetrahedral mesh in the convex hull of three-dimensional cospherical point set.Finally,the triangulation program can be successfully run in the Fortran platform.The data is postprocessed with Tecplot and the triangulation results are visible.