| 压入区段端点的区域填充扫描线算法 |
| |
| 引用本文： | 柳朝阳,李叔梁.压入区段端点的区域填充扫描线算法[J].计算机辅助设计与图形学学报,1996,8(6):415-419. |
| |
| 作者姓名： | 柳朝阳 李叔梁 |
| |
| 作者单位： | [1]郑州大学数学系 [2]清华大学电子工程系 |
| |
| 摘 要： | 本文对通常的区域填充扫描线算法进行改进，用区段端点入栈替代种子点入栈。改进后的算法不增加入栈出栈操作的次数，却免除了原算法中为获取众多象颜色值所需要的大量重复操作，对矩形区域这样减少操作的次数等于该区域中含象素的数目。
|
| 关 键 词： | 4－连通区域 区域填充 扫描线算法 计算机图形学 |
A NEW SCANLINE ALGORITHM FOR FILLING AREA WITH PUSHING SPAN ENDS |
| |
| Liu Chaoyang.A NEW SCANLINE ALGORITHM FOR FILLING AREA WITH PUSHING SPAN ENDS[J].Journal of Computer-Aided Design & Computer Graphics,1996,8(6):415-419. |
| |
| Authors: | Liu Chaoyang |
| |
| Abstract: | Instead pushing seed points into a stack, this paper presents a new scanline algorithm for filling area by pushing span ends. This algorithm avoids the numerous repeated operations for getting many pixel color values without increasing the number of push and pop operations. For a rectangular area, the decreasing number of the operations is equal to the number of the pixels contained in that area. |
| |
| Keywords: | adjacent connection area filling scanline algorithm seed point span |
| 本文献已被 CNKI 维普 等数据库收录！ |
