摘要
本文对通常的区域填充扫描线算法［１，２］进行改进，用区段端点入栈替代种子点入栈。改进后的算法不增加入栈出栈操作的次数，却免除了原算法中为获取众多象素颜色值所需要的大量重复操作。
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.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
1996年第6期415-419,共5页
Journal of Computer-Aided Design & Computer Graphics
