An Improved Filling Algorithm for Image with Complicated Closed Edges


Article Preview

This paper presents an efficient algorithm filling Images with complicated closed edges through analyzing and comparing several frequent filling algorithms for image. The filling algorithm, like algorithm of scan line filling, doesn’t use seed points, but has as good result as using seed points to fill. The algorithm is simple and feasible by testing, and can fill images with complicated close edges quickly and effectively.



Edited by:

Qi Luo






T. M. Wang et al., "An Improved Filling Algorithm for Image with Complicated Closed Edges", Applied Mechanics and Materials, Vols. 20-23, pp. 894-897, 2010

Online since:

January 2010




[1] David F. Rogers . Procederal Elements for Computer Graphics. Beijing: China Machine Press, 2005. pp.101-102.

[2] Donald Hearn,M. Pauline Baker. Computer Graphics[M]. Pearson Education Asia Limited and Tsinghua University Press. 2004. pp.158-163.

[3] Xingbin Liu, Fengsong Hu. A New Area Seed Filling Algorithm[J]. Bejing: Computer Engineer and Application, 2002. pp.101-103.

[4] Juan Du, Yongguo Zheng, Min Li. A Modified Scan Line Seed Fill Algorithm[J]. Shangdong: Information Technology and Informalize, 2007. pp.79-80.

[5] Qing Sun, Yongguo Zheng. Shortcoming of Scanline Filling Algorithm for Complicated Connecting Region and Its Improvement, 2007. pp.72-75.

In order to see related information, you need to Login.