通过扩展计算几何中“单调链”概念，提出了一种新的多边形扫描线填充算法，即基于单调链的扫描线多边形填充算法。
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.
通过分析多边形轮廓的填充特点，提出了一种填充扫描矢量方向的优化方法。
Through analyzing the filling characteristics of polygonal contours, an optimization method of scanning vectors for filling sectional contours was presented.
文章提出通用扫描线多边形填充算法，该算法可以有效地解决任意间距、任意倾角的扫描线对多边形的填充问题。
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.
应用推荐