一种基于位存储的种子填充算法

A Seed Filling Algorithm Based on Bit Memory

为了提高利用简单种子填充算法对区域填充的效率,主要方法是改进基本的算法思想,改变像素点着色和入栈的顺序,从而减少像素点入栈的次数,达到降低算法执行时所占空间的目的.在具体的程序实现时对像素点坐标的存储采用占用空间较多的整型,没有考虑到像素点坐标取值的实际情况,消耗空间较多.改进的种子填充算法就是在程序实现时采用位的形式来表示像素点的坐标,降低程序执行时所占空间,实验结果也表明了方法的有效性.

In order to improve the efficiency of area filling using simple seed filling algorithm, the main method is to innovate basic algorithm thought, changing the order of pixel shading and pushing area into stack, thereby reducing the tatal number of pushing area into stack. Thus the goal of reducing the space used when implementing the algorithm is achieved. However, the memory to pixel point coordinates takes more. occupancy space during the period of concrete procedure, and the actual situation of co- ordinates of the point values is not taken into consideration, and thus, more space is taken. The improved seed filling algorithm is used to express coordinates in the form of position point during the course of implementing the procedure, then further reduce the occupied place. And the experimental result has also proved the validity of this method.