线种子填充算法的改进.pdfVIP

第圆7 卷 第2 期 天 津 工 业 大 学 学 报 Vol.27 No.2 圆园园8 年4 月 韵哉砸晕粤蕴 韵云 栽陨粤晕 陨晕 孕韵蕴再栽耘悦匀晕陨悦 哉晕陨灾耘砸杂陨栽再 April 2008 扫描线种子填充算法的改进 文平 龙帮强 天津工业大学信息与通信工程学院袁天津 300160冤 摘 要 针对传统扫描线种子填充算法中存在的缺陷 提出了一种改进算法. 该算法根据填充区域边界的连续性和 相邻扫描线的相关性 只需将每个连续填充区域的起始信息入栈 而不需要将相邻的每条扫描线都入栈 避免了不必要的出入栈操作曰在填充过程中 根据相邻扫描线上填充区间的关系判断是否需要回溯和产 生新的填充区间 有效避免了不必要的回溯和像素的重复判读 提高了填充效率. 关键词院 区域填充曰种子填充算法曰扫描线曰四连通区域曰八连通区域 中图分类号 TP391.41 文献标识码 A 文章编号 员远苑员原园圆源载渊圆园园8冤园2原园园48原园4 Improvement of scan line seed fill algorithm GUO Wen-ping袁 LONG Bang-qiang School of Information and Communication Engineering 袁Tianji n Polytechnic University袁Tianji n 300160 袁China冤 Abstract 院 Against the defect of traditional scan line seed fill algorithm袁 an improvement algorithm is presented. Consider鄄 ing the continuity of region boundary and relativity of neighboring scan line袁 it needs only push the outset infor鄄 mation of new continual fill region rather than every scan line area into stack in filling. This will avoid needless operations of push stack and pop stack. According to the relations of filling area in neighboring scan line 袁 it j udge whether needs to backdate scanned scan line and to search the new filling area in current scan line. In this case 袁 it avoid needless retrospective operations 袁 reduce the number of repetitional pixel reading 袁 and enhance the filling efficiency. Key words 院 area filling曰 seed fill algorithm 曰 scan line曰 4-connected field 曰 8-connecte