期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：11
出版社：S.S. Mishra
摘要：In this paper, we introduce a modified fence fill algorithm for filling a polygon. Fence fill algorithm is a modified edge fill algorithm. As opposed to the edge fill algorithm that fills pixels starting from the polygon edge to the maximum screen coordinates, the fence fill algorithm fills pixels bounded by the polygon edge and the fence. This involves large number of calculations to find the intersection of the polygon edge with the scan line. Our method reduces the calculations by considering a single pixel in each region bounded by the fence and polygon edge. The inside-outside test is then applied to that pixel to determine whether the point lies inside or outside the bounded region. For large concave polygons, the older method is complicated as it requires more space and time. The new method promises a significant reduction in memory and time requirements
关键词：Polygon fill; Edg e fill; Fence fill; Inside-outside test
