三维种子填充算法的改进  

Improvement of 3D Seed Filling Algorithm

作　　者：薛斌党[1] 薛文芳[2] 姜志国[1] 

机构地区：[1]北京航空航天大学图像中心,北京100083 [2]中国科学院自动化研究所综合信息系统研究中心,北京100080

出　　处：《计算机辅助设计与图形学学报》2006年第10期1553-1556,共4页Journal of Computer-Aided Design & Computer Graphics

基　　金：国家自然科学基金(60372017)

摘　　要：改进了三维种子填充算法:修改了栈结构,采用区段索引表和区段表的方法存储扫描线区段信息和区段填充标志,用区段端点体素入栈代替种子体素入栈.通过设置区段填充标志,避免对已填充区段体素的重复判读,消除冗余种子体素的产生;利用相邻扫描线填充次序的连贯性消除不必要的回溯操作,并减少了回溯扫描区间.实验结果表明,改进算法提高了三维种子填充算法的效率.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.

关 键 词：三维种子点 区域填充 扫描线算法 6连通区域 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]