Cart (Loading....) | Create Account
Close category search window

Speeding up Bresenham's algorithm

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

2 Author(s)
Angel, E. ; New Mexico Univ., Albuquerque, NM, USA ; Morrison, D.

The line segment is the basic entity in virtually all computer graphics systems. J.E. Bresenham's algorithm (1965) efficiently scan converts line segments because it requires only an integer addition and a sign test for each pixel generated. It is the standard for scan converting a line segment. A version based on the properties of linear Diophantine equations that can speed scan conversion by a factor of almost five is presented. Two approaches are used to achieve speedup. One is to parallelize the line generation process. The other is to take advantage of the repeated patterns that the algorithm generates.<>

Published in:

Computer Graphics and Applications, IEEE  (Volume:11 ,  Issue: 6 )

Date of Publication:

Nov. 1991

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.