摘要
针对经典扫描线种子填充算法中存在的缺陷,给出了一种改进算法。改进算法消除了象素点颜色的重复判读操作,减少了回溯的扫描区间,并根据区域的连续性,将区段入栈改为新的搜索区入栈,大大减少了许多不必要的堆栈处理。
Against the defect of traditional scan line seed fill algorithm, this paper presents an improved atgorithm. The new algorithm eliminates the repeating operations for getting pixel colors and reduces the rescan span. Considering the continuity of area, it only need push the new searching areas rather than every scan line area into stack. In this case, it will reduce many needless operations of stack and raise the filling race.
出处
《信息技术与信息化》
2007年第3期79-80,共2页
Information Technology and Informatization
关键词
区域填充
4-连通区域
扫描线算法
种子点
Region filling 4 -adjacent connection Scan line algorithm Seed point
