一种改进的扫描线多边形填充算法

An Improved Scan Line Polygon Filling Algorithm

典型的多边形填充算法主要包括扫描线填充算法和轮廓标志域填充算法,适用于矢量多边形文件的填充算法为扫描线填充算法。论文对原有的多边形扫描线填充算法中的最常用的活性边表和传统扫描线算法进行了分析,结合活性边表和传统的扫描线填充算法的特点,针对复杂的大数据量的多边形填充时间效率较低的问题,提出了一种改进的扫描线多边形填充算法—混合填充算法。该算法采用链表和数组结合的数据结构,形成连续的填充轨迹,有效地提高了时间效率。

Typical polygon filling algorithm maiuly includes scan line filling algorithm and area marks filling algorith- m,and scan line filling algorithm suits vetor polygon filling. This paper makes some research on old and common poly- gon filling algorithm,and proposes an improved scan line polygon filling algorithm--nded filling algorithm,which has the both advantages of traditional and AET scan line polygon filling algorithm on complicated and mass data polygon filling. This algorithm adapts both list table structure and array structure,and can form unbroken filling line,and is tdrie efficiently.