压入区段端点的区域填充扫描线算法
A NEW SCANLINE ALGORITHM FOR FILLING AREA WITH PUSHING SPAN-ENDS
-
摘要: 本文对通常的区域填充扫描线算法1,2进行改进,用区段端点入栈替代种子点入栈.改进后的算法不增加入栈出栈操作的次数,却免除了原算法中为获取众多象素颜色值所需要的大量重复操作.对矩形区域这样减少操作的次数等于该区域中所含象素的数目.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.
下载: