New Filling Algorithm Based on Chain Code
Zhiyong Ju, Youguang Chen · Jisuanji gongcheng · 2007
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.