中文摘要：

This paper presents a reconstruction algorithm to build a surface mesh approximating an object from an unorganized point sampling of the boundary object. It combines 3D Delaunay tetrahedralization and mesh-growing method and uses only once Delaunay triangulation. It begins with 3D Delaunay triangulation of the sampling. Then initialize the surface mesh with seed facets selected from Delaunay triangulation. Selection is based on the angle formed by the circumscribing ball of incident tetrahedral. Finally, grow until complete the surface mesh based on some heuristic rules. This paper shows several experimental results that demonstrate this method can handle open and close surfaces and work efficiently on various object topologies except non-manifold surface with self-intersections. It can reproduce even the smallest details of well-sampled surfaces but not work properly in every under-sampled situation that point density is too low.

英文摘要：

This paper presents a reconstruction algorithm to build a surface mesh approximating an object from an unorganized point sampling of the boundary object. It combines 3D Delaunay tetrahedralization and mesh-growing method and uses only once Delau- nay triangulation. It begins with 3D Delaunay triangulation of the sampling. Then initialize the surface mesh with seed facets se- lected from Delaunay triangulation. Selection is based on the angle formed by the circumscribing ball of incident tetrahedral. Finally, grow until complete the surface mesh based on some heuristic rules. This paper shows several experimental results that demonstrate this method can handle open and close surfaces and work efficiently on various object topologies except non-manifold surface with self-intersections. It can reproduce even the smallest details of well-sampled surfaces but not work properly in every under-sampled situation that point density is too low.