A fast Triangular mesh generation Method and its engineering application

In a given 3D scattered point set, every point´s k neighborhood was, first of all, determined by using space-box partition, and then the third point was searched by the Delaunay Triangular Growth Method to generate triangle meshes. The process of third point searching repeats every time in the following same way. The searching was always undertaken on an approximate tangent plane, and the point got by searching every time will be used to determine the next searching. This algorithm has the characteristics of operating speedily and high-efficiently as well as being applicable broadly, and an example was given to prove its effectiveness.