三维非规则碎片的分块算法研究

A Segmentation Algorithm for Irregular Three Dimensional Objects Fragments

摘要:

提出一种动态增长的平均法矢准则,采用宽度优先搜索的方法,对三维非规则碎片分块.首先,随机地选取碎片几何模型上任意一个三角片作为种子网格,通过法矢比较,将法矢方向一致的三角片加入到当前的种子网格;计算经过增长了的种子网格的平均法矢并继续上述的比较过程,得到碎片模型的初步划分结果;然后,对初步划分得到的相互混杂的大小区域分类、融合,进一步优化分块结果.应用实例证明了算法的有效性和可靠性.

Abstract:

The rule of dynamic average normal vector is proposed to segment irregular three dimensional object fragments by breadth first. Any triangle is chosen at random from geometric model of fragment as a seed mesh. Through the comparison, the triangle, whose normal vector is coincident to the seed mesh, will be added in. The average normal vector is calculated for the increased seed mesh and the comparing process is continued until the primary segmentation is obtained. The interrelated regions are classified and amalgamated to farther optimize the results of segmentation. Experimental results demonstrate the algorithm is efficient and robust.