A new simple and efficient antialiasing with subpixel masks
- 1 July 1991
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 25 (4), 133-141
- https://doi.org/10.1145/122718.122733
Abstract
Antialiasing of edges is often performed with the help of subpixel masks that indicate which parts of the pixel are covered by the object that has to be drawn. For this purpose, subpixel masks have to be generated during the scan conversion of an image. This paper introduces a new algorithm for creating subpixel masks that avoids some problems of traditional algorithms, like aliasing of high frequencies or blinking of small moving objects. The new algorithms can be implemented by lookup tables that make use of the inherent symmetry of the algorithm. The results are compared with conventional supersampling. A hardware implementation is described.Keywords
This publication has 9 references indexed in Scilit:
- Pixel-planes 5: a heterogeneous multiprocessor graphics system using processor-enhanced memoriesACM SIGGRAPH Computer Graphics, 1989
- What we need around here is more aliasing (computer graphics)IEEE Computer Graphics and Applications, 1989
- A parallel algorithm for polygon rasterizationACM SIGGRAPH Computer Graphics, 1988
- Stochastic sampling in computer graphicsACM Transactions on Graphics, 1986
- Antialiasing through stochastic samplingACM SIGGRAPH Computer Graphics, 1985
- Fast spheres, shadows, textures, transparencies, and imgage enhancements in pixel-planesACM SIGGRAPH Computer Graphics, 1985
- Efficient alias-free rendering using bit-masks and look-up tablesACM SIGGRAPH Computer Graphics, 1985
- The A -buffer, an antialiased hidden surface methodACM SIGGRAPH Computer Graphics, 1984
- A parallel scan conversion algorithm with anti-aliasing for a general-purpose ultracomputerACM SIGGRAPH Computer Graphics, 1983