| 一种新的快速复杂连通区域扫描线填充算法 |
| |
| 引用本文： | 张志龙,李吉成,沈振康. 一种新的快速复杂连通区域扫描线填充算法[J]. 计算机工程与应用, 2004, 40(31): 6-8 |
| |
| 作者姓名： | 张志龙 李吉成 沈振康 |
| |
| 作者单位： | 国防科技大学电子科学与工程学院ATR国家重点实验室,长沙,410073;国防科技大学电子科学与工程学院ATR国家重点实验室,长沙,410073;国防科技大学电子科学与工程学院ATR国家重点实验室,长沙,410073 |
| |
| 摘 要： | 提出一种快速求取扫描线与轮廓线交点的算法,只需遍历2次轮廓线即可求得所有交点,显著降低了算法复杂度。基于该求交算法得到的扫描线填充算法,可以填充任意的复杂连通区域。与同类算法犤2,4,5犦相比,该文算法流程简单,填充速度快。
|
| 关 键 词： | 计算机图像学 轮廓 区域 区域填充 扫描线填充 |
| 文章编号： | 1002-8331-(2004)31-0006-03 |
| 修稿时间： | 2004-06-01 |
A New Fast Scan Line Filling Algorithm for Complicated Connecting Region |
| |
| Zhang Zhilong Li Jichen g Shen Zhenkang. A New Fast Scan Line Filling Algorithm for Complicated Connecting Region[J]. Computer Engineering and Applications, 2004, 40(31): 6-8 |
| |
| Authors: | Zhang Zhilong Li Jichen g Shen Zhenkang |
| |
| Abstract: | 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. |
| |
| Keywords: | computer graphics contour region region filling scan line filling |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
