关于扫描线种子填充算法的改进

Improve Line Seed Fill Algorithm

种子填充算法是交互式图示学中常用的区域填充算法,该算法主要是通过栈结构来实现的,简单种子填充算法把太多像素压入堆栈,有些像素甚至会多次重复入栈,这一方面降低了算法的效率,另一方面还要求很大的存贮空间以实现栈结构,解决这个问题的一个办法是改进简单种子填充算法为扫描线种子填充算法,该算法可以避免像素的重复入栈,但在寻找新的种子点时仍会对一些已处理过的扫描线进行检查,这对算法的效率还是会有一定的影响,本文针对这一问题提出一个改进的算法。

Seed Fill Algorithm (SFA) is a area fill algorithm. The algorithm is fulfiled by stack structure. Simple SFA pushes a lot of seed points into stack. Some seed points even are pushed repeatly On the one hand, it reduce the efficiency of algorithm. On the other hand, it needs much saving space for the stack structure. A solution to the problem is improving simple SFA into Line Seed Fill ALG. That algorithm can avoid that seed points are pushed into stack repeatly, but it check the line which have been dealt with when find out a new seed point. So it still has effect on algorithm. There is a improve in this paper.