Improvement of 3D seed filling algorithm

An improved 3D seed filling algorithm is proposed. The span index table and the span table are designed to store the span-ends and the filled span label. And during the filling processing, the span-ends of a scan-line are pushed into a stack instead of seed voxel. The improved algorithm avoid repeating searching seeds in the filled span by setting and reading the span filled label so as to eliminate the redundant voxel seeds. Considering the characters of the coherence of the filling order of adjacent lines, the improved algorithm avoid repeating examinations of the previously filled adjacent scan-line and reduce the rescan span. Experimental results show that the improved algorithm increases the 3D filling efficiency.