摘要
对经典区域填充扫描线算法进行了改进,改进算法不但消除了经典算法中象素点颜色判读的重复操作,而且利用相邻扫描线填充次序上的连贯性,消除了不必要的回溯处理,并减少了回溯扫描区间.最后,给出了算法之间的效率比较,由比较结果可以看出本文的算法较大幅度地提高了算法的效率.
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.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
北大核心
1998年第6期481-486,共6页
Journal of Computer-Aided Design & Computer Graphics
基金
国家863高技术基金
中科院计算所所长基金
科学与工程计算国家重点实验室的资助
关键词
区域填充
扫描线算法
计算机图形学
area filling, scanline algorithm, 4 adjacent connection, seed point