IMPROVEMENT OF AREA FILLING SCANLINE ALGORITHM

This paper presents an improved scanline algorithm for area filling. The new algorithm not only eliminates the repeating operations for getting pixel colors in classical algorithm, but also avoids the redundant examinations of the previously filled adjacent line and reduces the rescan span by using the coherence of the filling order of adjacent lines. At last, the paper also compares the efficiency of several algorithms. It can be concluded that the new algorithm increases efficiency greatly.