摘要： 填充是计算机图形处理领域的基本算法。该文提出一种填充算法，解决了顶点链编码表示区域的填充问题。该算法只需2种辅助标记颜色，处理灰度图像时无需附加内存，空间复杂度低。其运算效率接近最低时间复杂度，即填充区域面积加周长。处理表格图像所需时间仅为Ren算法的1/3。

关键词: 填充, 顶点链编码, 边界点标记

Abstract: Contour filling is one of the most important problems in image and graphics processing. This paper presents a new filling algorithm for vertex chain code. The algorithm needs only two assistant colors, and does not need the EMS memory for the full gray image. The time spending is close to the lowest, the area plus the perimeter, especially 1/3 time consume needed for filling table image compared with the most effective algorithm Ren.

Key words: filling, vertex chain code, edge labeling

中图分类号: 

• TP391.41