Efficient polygon-filling algorithms for raster displays
- 1 October 1983
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 2 (4), 264-273
- https://doi.org/10.1145/245.248
Abstract
Parity-based algorithms are described for coloring the interior of a polygon drawn on a raster display. The polygon is input as a chain of incremental moves. These algorithms are automatic in the sense that they require no manually specified interior point. First a distinction is made between two possible coordinate systems for a raster display, the region-oriented and vector-oriented coordinate systems. The Edge Fill algorithm of Ackland and Weste is given for the region-oriented coordinate system, and then is adapted for the vector-oriented coordinate system. Next the algorithm is enhanced in two ways, denoted Fence Fill and Pairwise Fill, which trade storage for speed. Finally, in the Appendix, a correctness property of the vector-oriented version of Edge Fill is proved.Keywords
This publication has 3 references indexed in Scilit:
- Contour filling in raster graphicsACM SIGGRAPH Computer Graphics, 1981
- The edge flag algorithm — A fill method for raster scan displaysIEEE Transactions on Computers, 1981
- Tint fillACM SIGGRAPH Computer Graphics, 1979