摘要： 多边形填充是计算机绘图的一项重要内容,它在动画、阴影、地图绘制及剖面线等方面得到了广泛应用。由于多边形的边数往往很多,且填充线条很密,因此,采用比较有效的算法以减少计算时间是十分必要的。本文提出了一种多边形填充的快速算法。

关键词: 计算机绘图, 多边形填充, 算法

Abstract: Filling-polygon is essential part of computer graphics, It is widely used in the fields of animating, shading and mapping. Because of the large numbers of the edges and small distance between the filling lines, it is important to find a faster algorithm of filling- polygon. This paper makes an improvement on the fast algorithm of filling-polygon. And filling time becomes less.

中图分类号: 

• TP391.41