Filling Algorithm for Vertex Chain Code Image
Guoqing Gu · Jisuanji gongcheng · 2008
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.