The paper proposed a region filling algorithm based on crack chain code description. The algorithm of single crack chain code and a fast filling algorithm about the complicated connecting region or the global image are given

in which only the image regions is filled. Compared with the conventional algorithms

this algorithm requires no storage and works well for any complex regions. Experimental results prove that it is faster and more efficacious.