ACM Home Page
Please provide us with feedback. Feedback
Efficient polygon-filling algorithms for raster displays
Full text PdfPdf (419 KB)
Source ACM Transactions on Graphics (TOG) archive
Volume 2 ,  Issue 4  (October 1983) table of contents
Pages: 264 - 273  
Year of Publication: 1983
ISSN:0730-0301
Author
Michael R. Dunlavey  Boston College, Boston, MA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 196,   Citation Count: 2
Additional Information:

references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/245.248
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ACKLAND, B.D., AND WESTE, N.H. The edge flag algorithm--a fill method for raster scan displays, IEEE Trans. Comput. C-30, 1 (Jan. 1981), 41-47.
 
2
 
3
4
5



REVIEW

"Joseph J. O'Rourke : Reviewer"

Polygon-filling algorithms are ubiquitous in computer graphics. They come in two main varieties: flood algorithms, which grow to all connected pixels from a seed, and parity-based algorithms, which invert interior pixels a  more...

Collaborative Colleagues:
Michael R. Dunlavey: colleagues