By Topic

Accurate rendering by subpixel addressing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lathrop, O. ; Apollo Comput., Chelmsford, MA, USA ; Kirk, D. ; Voorhies, D.

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.<>

Published in:

Computer Graphics and Applications, IEEE  (Volume:10 ,  Issue: 5 )