摘要
提出了一种基于快速行进法的区域填充算法,可用于内点表示或边界表示的4 连通区域的单色和渐变填充。给定区域内的一点(种子点)和要填充的颜色,算法按照快速行进法计算的波前到达时间对区域进行填充,直到整个区域填充完毕。算法的时间复杂性为O (nlogn)。
present a region filling algorithm based on Fast Marching Method, which can be used in one color or gradient filling for both boundary-defined regions and interior-defined 4-connected regions. Given a pixel (seed point) interior to a region and the filling color, the algorithm fills all other pixels interior to the region according to the arrival time of the front computed by fast marching method. It takes O(nlogn) time assuming there are n points in the region.
出处
《工程图学学报》
CSCD
北大核心
2005年第2期31-34,共4页
Journal of Engineering Graphics
基金
国家自然科学基金资助项目(64073103)
关键词
计算机应用
算法
快速行进法
区域填充
computer application
algorithm
fast marching method
region filling
