Issue No. 06 - November/December (1991 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/38.103388
<p>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.</p>
D. Morrison and E. Angel, "Speeding Up Bresenham's Algorithm," in IEEE Computer Graphics and Applications, vol. 11, no. , pp. 16-17, 1991.