A new and fast contour-filling algorithm

Contour filling is one of the most common problems in image and graphics processing. The executing speed of the contour filling is vital, especially for a real-time system. This paper studies the advantages and disadvantages of the conventional filling algorithms, analyzes their original ideas, and proposes a new filling algorithm. The new algorithm presents a very simple idea for finding seeds automatically, and limits the scan within the filling regions. Repeated experiments have proven that with the new algorithm, any complex inner and outer contours can be filled with higher speed.