摘要： 区域填充染色的一般解决方法并不适用于空间曲面。为解决该问题，提出一种适用于空间三角面网格的种子填充算法。通过改变种子点的判定方法，将平面种子填充算法扩展到空间三角面网格上，在细分三角面网格结构时，使用以轮廓线为引导的细分策略，并利用凸包的一些特殊性质对轮廓点进行筛选。实验结果表明，该算法可以较好地完成三角面网格的区域填充染色，在效率和填充效果方面都可以满足实际应用。
关键词:
区域填充,
种子填充算法,
三角面网格,
三角形细分,
凸包,
虚拟手术
Abstract: Aiming at the problem that the general boundary-fill approach cannot work effectively for space surfaces, this paper proposes a seed-fill algorithm which is available for the triangular meshes. By changing the way to determine a seed, it makes the algorithm available for the 3D meshes. This subdivision algorithm is guided by the contour, and filters the subdivision point by some feature of the convex hull. Experimental result shows that this algorithm can do boundary-fill on triangular meshes well, has practical value, satisfies the practical need in the area of both efficiency, and fills effect of algorithm proposed.
Key words:
boundary-fill,
seed-fill algorithm,
triangular surface mesh,
triangle subdivision,
convex hull,
virtual surgery
中图分类号:
朱晨阳, 熊岳山, 谭珂, 潘新华. 基于三角面网格细化策略的改进种子填充算法[J]. 计算机工程, 2013, 39(7): 279-283.
SHU Chen-Yang, XIONG Yue-Shan, TAN Ke, BO Xin-Hua. Improved Seed-fill Algorithm Based on Refinement Strategy of Triangular Surface Mesh[J]. Computer Engineering, 2013, 39(7): 279-283.