A Fill Algorithm For Arbitrary Polygon Based On Monotone Chain
Yang Si-qing · Natural Science Journal of Xiangtan University · 2000
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. At first monotone chain of polygon is spaned in the new algorithm. Second, the nonregular vertices are sorted by Y-coordinate. At last active monotone chain is established and filling of polygon is finished .The running time and stored space of new algorithm less than the tradition ones.