基于顶点存储类型的多边形填充算法

提出了一种基于顶点存储类型的多边形填充算法。该算法将多边形顶点和新生成的交点划分为三种类型进行存储，然后由过顶点的扫描线将多边形分割成若干个梯形区域分别进行填充。此算法只涉及过顶点的扫描线，且多边行边上的像素点坐标可以直接从边的直线方程中获得，从而使得该算法大大降低了计算的复杂性。

A New Polygon Filling Algorithm based on the Vertex Storage Types

This paper presents a new polygon filling algorithm based on vertex storage types.The algorithm will divide the polygon vertex and the new nodes into three types of storage,and then the scan line through the vertex will divide the polygon into several regionals to filled.This algorithm only relate to the scan line through the vertex and the pixel coordinates of the polygon edges can be directly calculation from the linear equation of the polygon edges. Consequently,the algorithm greatly reduce the computational complexity.