一种散乱点云空间直接剖分算法

Direct Triangulation Algorithm for Three-dimensional Scattered Points

散乱点云的三角剖分在曲面重建中发挥着重要作用。在对三角剖分基本方法深入分析的基础上对此类点云提出了一种高效的重构算法。本算法将基于动态球策略的搜索算法引入到曲面重建中,源于增量式计算的思想,结合约束准则和设计的顶点度量函数,从基础三角面片开始扩展到覆盖整个物体表面。分析及实验结果表明,该算法能有效地对点云数据进行三角网格化,同时剖分后的三角网格曲面最大限度地保持了原有曲面的特性,证明了提出的基于动态球的曲面重构算法应用于散乱点云曲面重构问题的可行性。

The triangulation of scattered points plays an important role in surface reconstruction. This paper provided an efficient triangle algorithm for this kind of point, based on deeply analyzing the basic method of triangulation. This algo-rithm puts the strategy of dynamic ball into surface reconstruction, from the incremental computation theory and the constraint method and vertex measure function, is extended to cover the entire surface starting from a basic triangle. The experimental result and analysis show that this algorithm not only reconstructs surface efficiency, but also furthest keeps the characteristics of original surface. Both theoretical analysis and simulation results justify the feasibility of the algorithm above.