一种基于三维Delaunay三角化的曲面重建算法

提出一种基于三维Delaunay三角化的区域增长式曲面重建方法。该方法以空间点云的Delaunay三角化为基础，结合局部区域增长的曲面构造，较以往方法具有人为参与更少、适用范围更广的优点。算法采用增量式插入点的方式构建空间Delaunay划分，采用广度优先算法，以外接圆最小为准则从Delaunay三角化得到的四面体中抽取出合适的三角片构成曲面。该算法的设计无须计算原始点集的法矢，且孔洞系数对重建的结果影响很小，重建出的三角网格面更符合原始曲面的几何特征。无论待建曲面是否是封闭曲面，本算法均可获得较好的重建效果。

A Geometric Spread Approach of 3-D Reconstruction

It introduces a method of 3D surface reconstruction. As many other algorithms of this kind, it produces a piecewise linear approximation of a surface S from a finite, sufficiently dense, subset of its points. It is based on the 3D Delaunay triangulation of points, and uses the local area incremental algorithm to build the triangular mesh. Build up the 3D Delaunay triangulation through incremental insertion of points, and use breadth-first algorithm to pick the appropriate facets to reconstruct surfaces. The algorithm doesn＇t need preprocessing of input data and nearly user input independent. Present some results of the method, which turn out to be good on surfaces with and without boundaries.