摘要
提出一种快速求取扫描线与轮廓线交点的算法,只需遍历2次轮廓线即可求得所有交点,显著降低了算法复杂度。基于该求交算法得到的扫描线填充算法,可以填充任意的复杂连通区域。与同类算法犤2,4,5犦相比,该文算法流程简单,填充速度快。
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.
出处
《计算机工程与应用》
CSCD
北大核心
2004年第31期6-8,共3页
Computer Engineering and Applications
基金
国家部委项目
