摘要： 将计算机图形学的栅栏填充算法移植到链码的填充算法中，发展出了一种新的基于链码的填充算法。利用边界Freeman链码，定义了一种新的边界点分类方法，通过对边界上的左右端点到栅栏间的像素取补填充该区域，算法能填充任意复杂图像区域，不需要辅助内存空间和标记边界色。与现有的算法进行了对比实验，实验表明该文提供的算法对于图像具有填充速度快、效率高等优点。

关键词: Freeman链码, 栅栏, 区域填充

Abstract: A new filling algorithm based on chain code is transplanted from raster filling algorithm in computer graphics. A new boundary point classifying method is defined by using boundary Freeman chain code. The algorithm fills pixels between left point or right point of contour and raster line with complement operation, thus it can handle arbitrary complicated region without supplementary memory space or additional labeling. Experiments show that the proposed algorithm is faster and more efficient than existing ones.

Key words: Freeman chain code, raster, region filling

中图分类号: 

• TP391.41