基于链码描述的轮廓填充是图象处理的基础算法，已广泛应用于图象处理、目标分析、图象压缩和计算机图形学中，但存在需要较大的辅助空间和速度较慢的问题。为此，在分析现有算法的基础上，提出了一类基于将整条码链的填充分解成子链填充的算法，这样每条子链都是简单封闭轮廓，与现有算法相比，该算法最大仅需要屯友链等大的辅助空间，而且在非二值图象或码链允许更改时，可不需要任何辅助空间；另外，该算法既不需要排序操作，也不需要用人工交互的方式给出种子，即可通过在子链中根据相邻链码的值来自动给出种子，理论和实验表明，该方法能正确填充任意复杂形状的轮廓，并具有实现方便、速度快、算法简单、易于理解等特点，此快速简单算法具有很大的应用价值。

Contour filling is one of the most common problems in image and graphics processing and plays a very important role in many in many applications, such as image analysis, pattern recognition and computer graphics. The paper proposed a new concept of sub-chain and a new sub-chain based filling algorithm. The new algorithm is based on separating the whole contour into many simple sub contours and then does filling in each sub contour. Compared with the conventional algorithms, the new algorithm has five advantages. (1) Its speed is faster and its implementation is easier. (2) It needs less storage-just need size-fixed temporary memory or none in many cases. (3) It finds seeds for filling automatically and easily. (4) It needs neither sorting operation nor discrete Green's theorem to find the seeds for filling. (5) It can be implemented with flexible forms according to the different background of applications. Theory and experiments prove it can fill any complex regions with more convenient, faster speed, more simple, more applicable. It can be used widely in applications of graphics and image processing.