基于点邻域平坦度的网格重构算法

Mesh Reconstruction Algorithm Based on Neighborhood Smoothness Measure

提出一种对散乱数据点进行网格重构的区域扩张算法.首先计算每个点的邻域平坦度,并在平坦区域构造一个种子三角面片;然后优先选取落在平坦区域的活动边进行扩张,并在扩张过程中引入平坦趋势作为最佳点选择的准则;最后通过后续处理构造出二维流形网格.实验结果表明,该算法能充分利用点邻域的平坦信息减少拓扑和几何错误发生的概率,较好地保持实体模型的尖锐特征.

A region-growing algorithm is proposed to reconstruct triangular meshes from unorganized point cloud. The algorithm firstly computed the neighborhood smoothness of each point and constructed an initial seed triangle in the smooth region; then the active edge from the smooth region is chosen to grow according to priority and the neighborhood smoothness is introduced to select the satisfied candidate point for constructing a new triangle in each growing; finally, a manifold mesh is constructed by a post process. Experimental results show that the proposed algorithm can reduce the possibility of making topological and geometric errors by fully considering the smoothness of each point＇ s neighborhood and preserve the sharp edge of the underlying-object naturally.