文档介绍：摘要
区域填充问题在计算机图形中是很常见的,是个很基础,务必解决的问题,尤其是在图像处理的过程中。一般来说,要对一幅图像进行处理就必然会用到许多算法,而区域填充就是其中的基本算法之一,不仅如此,区域填充在图像处理﹑目标分析﹑图形压缩机及计算机图形学其他分支中也有广泛的应用。所以从图形学发展到现在,区域填充一直受到许多学者的青睐,他们不停的探索和研究区域填充算法,如今几经出现了很多的区域填充算法,包括传统的区域填充算法和改进的区域填充算法。传统的区域填充算法的填充出来的结果是不够完善的,还存在很多的不足,而且算法的效率也很低,本论文就是在介绍扫描线填充算法和种子填充算法的基础上,结合两者的优点,然后指出自动填充算法,这种填充算法具有的最大优点是适用于任何复杂的区域。实现这种算法的方法有两种,一种是基于缝隙码的,另一种是基于链码的,经过填充效率测试和评估,相较以前都有不少的改进,所以他们都属于改进型的区域填充算法。本文最后基于求封闭图形面积的思想提出了基于曲线积分的区域填充算法,该算法最大的特点就是能填充任何封闭区域,算法速度较快,而且填充效率也很高,能适应各种图形的区域,填充结果的重复性也相当的好,该算法与其他区域填充算法的最大不同是,它是通过图形图像的轮廓边界像素点来判断是否为区域的内点,传统的算法则是需要不断重复判断像素点是否为区域内的点。我们知道,多边形填充算法要求区域的形状是简单点的,它是对区域形状有一定限制的;而种子填充算法的首要条件是知道区域内的一点,并把它作为种子,其次还要判断像素点是否在区域内,这个判断过程是不停的重复的,直到找到全部的区域内像素点,而基于曲线积分的区域填充算法则可以从根本上克服这两种填充算法的弊端。
关键词:计算图形学;区域填充;填充算法;曲线积分:
ABSTRACT
In this paper .Region filling algorithm is one of the basic problem puter graphics .image region filling algorithm is basic algorithm of image processing .and is widely used in image processing .target analysis .pressor puter graphics . So area filling has been research hot spots .Traditional region filling algorithm is plete filling results and algorithm efficiency is not high question .the analysis of the two traditional area filling algorithm principle .introduces four kinds of the improved area filling algorithm respectively .and on the efficiency of these algorithms were analyzed .and on this basis .put forward a new geometry area filling algorithm .this algorithm is based on the curve integral and closed area .the basic principle of the algorithm is puting speed .strong adaptability graphics .good repeatability and don’t need to fill results area points repeated judgment can fundamentally e the polygon filling algorithm for regional shape has certain limitation speed filling algorithm requires know area as well as to the pixels in the area of the disadvantages of repeated judgment the algorithm can accurately adapted to any kind of scanning the boundary curve area filling process.
Key words: Calculation of