Efficient alias-free rendering using bit-masks and look-up tables

  • Authors:
  • Greg Abram;Lee Westover

  • Affiliations:
  • The University of North Carolina at Chapel Hill;The University of North Carolina at Chapel Hill

  • Venue:
  • SIGGRAPH '85 Proceedings of the 12th annual conference on Computer graphics and interactive techniques
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

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.