This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Speeding Up Bresenham's Algorithm
November/December 1991 (vol. 11 no. 6)
pp. 16-17

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.

1. J.E. Bresenham, "Algorithm for Computer Control of a Digital Plotter,"IBM Systems J., Vol. 4, No. 1, 1965, pp. 25-30.
2. W.E. Wright, "Parallelization of Bresenham's Line and Circle Algorithms,"IEEE CG&A, Vol. 10, No. 5, Sept. 1990, pp. 60-67.
3. C.M.A. Castle and M.L.V. Pitteway, "An Application of Euclid's Algorithm to Drawing Straight Lines,"Fundamental Algorithms for Computer Graphics, NATO ASI F17, Springer-Verlag, 1985, pp. 134-139.
4. R.A. Earnshaw, "Line Tracking for Incremental Plotters,"The Computer J., Vol. 23, No. 1, Feb. 1980, pp. 46-52.
5. I. Niven and H. Zuckerman,Introduction to the Theory of Numbers, Wiley, New York, 1980.

Citation:
Edward Angel, Don Morrison, "Speeding Up Bresenham's Algorithm," IEEE Computer Graphics and Applications, vol. 11, no. 6, pp. 16-17, Nov.-Dec. 1991, doi:10.1109/38.103388
Usage of this product signifies your acceptance of the Terms of Use.