传统的扫描线多边形填充算法只适用于水平扫描线的逐行填充。

Traditional scan-line Polygon-Filling Algorithm can only deal with horizontal scan-lines and can only fill a polygon line by line.

youdao

文章提出通用扫描线多边形填充算法，该算法可以有效地解决任意间距、任意倾角的扫描线对多边形的填充问题。

This paper puts forward General scan-line polygon fill algorithm. This algorithm can use scan-lines of varied interval and varied slope to fill a polygon.

youdao

通过扩展计算几何中“单调链”概念，提出了一种新的多边形扫描线填充算法，即基于单调链的扫描线多边形填充算法。

This paper extends the concept of monotone chain in computational geometry. It presents a new polygon scanning fill algorithm, polygon filling algorithm based on monotony chain.

youdao