ACM Home Page
Please provide us with feedback. Feedback
Efficient alias-free rendering using bit-masks and look-up tables
Full text PdfPdf (2.30 MB)
Source International Conference on Computer Graphics and Interactive Techniques archive
Proceedings of the 12th annual conference on Computer graphics and interactive techniques table of contents
Pages: 53 - 59  
Year of Publication: 1985
ISBN:0-89791-166-0
Also published in ...
Authors
Greg Abram  The University of North Carolina at Chapel Hill
Lee Westover  The University of North Carolina at Chapel Hill
Sponsor
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 48,   Citation Count: 11
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/325334.325177
What is a DOI?

ABSTRACT

We demonstrate an efficient method of rendering alias-free synthetic images using precomputed convolution integrals. The method is based on the observation that a visible polygon fragment's contribution to an image is solely a function of its position and shape, and that within a reasonable level of accuracy, a limited number of shapes represent the majority of cases encountered in images commonly rendered.The convolution integral is precomputed for all pixels affected by the polygon fragment and is stored in a table. Completely visible fragments which are either triangular or trapezoidal produce two indices into the table. Most other fragments which are represented as differences of simple fragments. The remaining cases are characterized by a bit-mask for which each bit has a corresponding set of look up tables.The basic technique has been applied to several fundamentally different rendering algorithms. In addition, we illustrate a version of the newly introduced nonuniform sampling technique implemented in the same program, but with different table values.


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
Abram, G.D., forthcoming PhD dissertation.
2
3
4
5
6
 
7
Crow, F.C., "A Comparison of Antialiasing Techniques," IEEE Computer Graphics and Applications, 1, 1, Jan. 1981.
8
9
 
10
Fuchs, Henry, John Poulton, AI Paeth, and Alan Bell, "Developing Pixel Planes, a Smart Memory- Based Raster Graphics System", Proceedings of the 1982 MIT Conference on Advanced Research in VLSI.
 
11
 
12
Mitchell, Don P., "Antialiased Ray Tracing By Nonuniform Sampling," AT&T Bell Labs., unpublished report, Dec. 1984.
 
13
Jerri, A.J., "The Shannon Sampling Theorem- Its Various Extensions and Applications: A Tutorial Review," Proc. IEEE, 66, 11, Nov. 1977.
 
14
Robinson, John, tutorial notes for State of the Art in Imase Synthesis Seminar, SIGGRAPH '81.
 
15
Shapiro, H.S., and R.A. Silverman, "Alias Free Samplin~ of Random Noise," J. SIAM, 8, Jun. 1960.
16
17
18

CITED BY  11
 
 

Collaborative Colleagues:
Greg Abram: colleagues
Lee Westover: colleagues

Peer to Peer - Readers of this Article have also read: