基于等间距平行线区域填充算法  

REGION FILLING ALGORITHM BASED ON EQUAL INTERVAL PARALLEL LINES

作　　者：邱国清[1] 

机构地区：[1]闽南师范大学计算机学院,福建漳州363000

出　　处：《内蒙古农业大学学报（自然科学版）》2017年第2期89-92,共4页Journal of Inner Mongolia Agricultural University(Natural Science Edition)

基　　金：福建省教育厅中青年教师教育科研项目(JAT160290)项目负责人

摘　　要：多边形区域填充的递归种子填充算法存在一个点多次进入堆栈和扫描线种子填充算法重复判断大量像素点的缺陷,为此提出一种基于等间距平行线区域填充新算法,首先采用Douglas-Peuker算法对复杂多边形化简,其次采用等间距平行线绘制多边形区域,最后计算每条平行线经过内点的个数及相应的行列值,完成区域填充。实验数据验证,该算法填充效率良好,无需对内点重复判断,特别适合于多边形嵌套的区域填充。Recursive seed filling algorithm of polygon filling a point several times into the stack and the scan line seed fill algorithm repeated whether a large number of pixels, this paper proposed a new algorithm based on the filling distance between the parallel line area, the first ues Douglas - Peuker algorithm for complex polygon simplification, followed by drawing the polygon distance parallel lines, and finally calculate the number of each parallel line passes through the point within the ranks and corresponding values, to complete the regional filling. Experimental data verify the algorithm efficiency is good, no need to repeat in judgment, especially suit- able for the polygon filling area.

关 键 词：Douglas-Peuker算法 等间距平行线 内点 行列值 区域填充 

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