A new triangulation algorithm from 3D unorganized dense point cloud

This paper presents an algorithm for triangular mesh generation from unorganized points based on 3D Delaunay tetrahedralization and mesh-growing method. This algorithm requires the point density to meet the well-sampled condition in smooth regions and dense sampling in sections of a great curvature and two close opposite surfaces. The principle of the algorithm is as follows. It begins with 3D Delaunay tetrahedralization of all sampling points. Then extract part of triangles belonging to the surface as the seed facets according to the rough separation characteristics which based on the angle formed by the circumscribing balls of incident tetrahedrons. Finally, the algorithm grows the seed facets from front triangles to all triangles of the surface. This paper shows several experimental results which explain this approach is general and applicable to various object topologies.