A New Fast Scan Line Filling Algorithm for Complicated Connecting Region
Atr La · Computer Engineering and Applications Journal · 2004
In this paper,a fast algorithm is present ed to acquire the cross points between the scan line and the contours.It needs ransacking the contour points only two times to acquire all the cross points,which saliently reduce the complexity.Based on the fast cross point acquiring algorithm,a new scan line filling algorithm is easily obtained that can be used to fill any complex connecting regions.Compared with algorithms presented in犤2,4,5犦,the scan line filling algorithm has such advantages as simplicity and speediness.