扫描线多边形填充算法 scan line polygon filling algorithm
通过对多边形可见边的分析，利用平面扫描技术，给出了求其可见边的算法。
By analysing of the visibility edges of the polygons, using the plane sweep technique, we present an algorithm to find the visibility edges of the set of polygons.
通过分析多边形轮廓的填充特点，提出了一种填充扫描矢量方向的优化方法。
Through analyzing the filling characteristics of polygonal contours, an optimization method of scanning vectors for filling sectional contours was presented.
通过扩展计算几何中“单调链”概念，提出了一种新的多边形扫描线填充算法，即基于单调链的扫描线多边形填充算法。
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.
应用推荐