DocumentCode
1250142
Title
Accurate rendering by subpixel addressing
Author
Lathrop, Olin ; Kirk, David ; Voorhies, Doug
Author_Institution
Apollo Comput., Chelmsford, MA, USA
Volume
10
Issue
5
fYear
1990
Firstpage
45
Lastpage
53
Abstract
A simple method is presented for eliminating most pixel-positioning errors when rendering lines and polygons with J.E. Bresenham´s algorithm (see IBM Syst. J., vol.4, no.1, p.25-30 (1965)). The method affects only the calculation of the initial values for Bresenham´s vector-generating algorithm. It does not alter the actual vector-generating algorithm, requiring only inter arithmetic to find the next pixel in a vector. The method eliminates all dropouts and virtually all overlaps between adjacent polygons whose edges lie on the same line. This eliminates the need to grow polygons to avoid dropout and opens the possibility of drawing surfaces composed of adjacent polygons with read modify/write pixel operations such as add or alpha buffering. It is shown that most rendering artifacts of today´s display controllers ultimately result from pixel-positioning errors, not insufficient z-buffer resolution.<>
Keywords
computational geometry; computer graphics; inter arithmetic; pixel-positioning errors; polygons; rendering lines; subpixel addressing; vector-generating algorithm; Application software; Arithmetic; Computer graphics; Displays; Hardware; Kirk field collapse effect; Rendering (computer graphics);
fLanguage
English
Journal_Title
Computer Graphics and Applications, IEEE
Publisher
ieee
ISSN
0272-1716
Type
jour
DOI
10.1109/38.59036
Filename
59036
Link To Document