A fast 3D seed-filling algorithm
The 3D seed-filling algorithm that fills consecutive object voxels at a time has shown higher efficiency than the method of filling only one voxel at a time. However, it searches seeds for filled voxels already containing no seeds. This paper presents a fast 3D seed-filling algorithm that uses a 2D pointer array of linked lists to avoid the redundant seed searches. The linked lists record the spans of filled voxels. Five comparison cases determine the current filling span, and the neighboring spans for searching seeds are either non-overlapping, or completely or partially overlapping. Seed searches are executed only for the non-overlapping span or part (in the case of the partial overlapping span) to minimize the searches. The experimental results show that the proposed algorithm is effective in eliminating the redundant seed searches and achieves high efficiency.
seed search object fill volume graphics