Surface reconstruction from unorganized points based on 2D Delaunay neighbors
Dongri Shan, Ying-Lin Ke · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2002
The problem of surface reconstruction from unorganized points has been, and continues to be, an important topic of research. Surface reconstruction can be widely used in reverse engineering and visualization of scientific data, etc. In this paper, a new algorithm for surface reconstruction from unorganized points in R is proposed. The algorithm is based on the theorem that the tangent plane of any point on a manifold surface local linear approximates the surface, which means that any point in one scattered point's neighborhood can be found one and only one projection in its tangent plane. In order to reconstruct a surface interpolating the scattered points, we first project the neighbor points of one sample point p to its tangent plane and find its 2D starlike Delaunay neighbors. After that, we define the points whose projection is 2D Delaunay neighbors of p as its 3D Delaunay neighbors. At last, the triangular mesh can be obtained based on the principle that three points consisted one triangular plane patch ifthey are 3D Delaunay neighbors each other. Experimental results show that this algorithm is effective, robust and the output mesh accords with Delaunay character.