ACM Home Page
Please provide us with feedback. Feedback
An Algorithm for Filling Regions on Graphics Display Devices
Full text PdfPdf (287 KB)
Source ACM Transactions on Graphics (TOG) archive
Volume 2 ,  Issue 3  (July 1983) table of contents
Pages: 192 - 196  
Year of Publication: 1983
ISSN:0730-0301
Authors
J. M. Lane  Vulcan Software Inc., 93 South Central Ave., Campbell, CA
R. and M. Rarick  Boeing Corporation, Mail Stop 35-02, P.O. Box 3707, Seattle WA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 69,   Citation Count: 1
Additional Information:

references   cited by   index terms   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/357323.357326
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), 762-791.
2
3
 
4
LEwis, B. A., AND ROBINSON, J. S. Triangulation of planar regions with applications. Comput. J. 21, 4 (Jan. 1978), 324-332.
 
5
PAVLIDIS, T. Filling algorithms for raster graphics. Comput. Gr. Image Process. 10 (1979), 126- 141.
 
6
SCHACHTER, B. Decomposition of polygons into convex sets. IEEE Trans. Comput. C-27, 11 (Nov. 1978), 1078-1082.
 
7
GOURAUD H. Computer display of curved surfaces. IEEE Trans. Comput. C-20, 6 (June 1971), 623-628.
 
8
JARVIS, J. F., JUDICE, C. N., AND NINKE, W. H. A survey of techniques for the display of continuous tone pictures on bilevel displays. Comput. Gr. Image Process. 5 (1976), 13-40.
 
9
MYERS, A. An efficient algorithm for computer generated pictures. Ohio State University Computer Graphics Research Group document, 1975.
10
 
11


Collaborative Colleagues:
J. M. Lane: colleagues
R. and M. Rarick: colleagues