| 区域填充扫描线算法的改进 |
| |
| 引用本文： | 任继成,刘慎权.区域填充扫描线算法的改进[J].计算机辅助设计与图形学学报,1998,10(6):481-486. |
| |
| 作者姓名： | 任继成 刘慎权 |
| |
| 作者单位： | 中国科学院计算技术研究所ＣＡＤ开放实验室 |
| |
| 基金项目： | 国家863高技术基金,中科院计算所所长基金,科学与工程计算国家重点实验室的资助 |
| |
| 摘 要： | 对经典区域填充扫描线算法进行了改进，改进算法不但消除了经典算法中象素点颜色判读的重复操作，而且利用相邻扫描线填充次序上的连贯性，消除了不必要的回溯处理，并减少了回溯扫描区间。最后，给出了算法之间的效率比较，由比较结果可以看出本文的算法较大幅度地提高了算法的效率。
|
| 关 键 词： | 区域填充 扫描线算法 计算机图形学 |
IMPROVEMENT OF AREA FILLING SCANLINE ALGORITHM |
| |
| REN Ji Cheng\,LIU Shen Quan.IMPROVEMENT OF AREA FILLING SCANLINE ALGORITHM[J].Journal of Computer-Aided Design & Computer Graphics,1998,10(6):481-486. |
| |
| Authors: | REN Ji Cheng\ LIU Shen Quan |
| |
| Abstract: | 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. |
| |
| Keywords: | area filling scanline algorithm 4 adjacent connection seed point |
| 本文献已被 CNKI 维普 等数据库收录！ |
