The Bresenham algorithm draws lines and employs integer arithmetic. Further, many of its operations are increments and/or decrements by one, or multiplications by two (shift left in hardware). This makes it very simple to implement using assembly languages as well as in hardware. Virtually all computer graphics hardware nowadays implements some variant(s) of the Bresenham algorithm to draw lines (and more complex shapes like circles). See one implementation of the Bresenham algorithm for (dx > 0, dy > 0, dx > dy) lines, below.

פרופ' גרשון אלבר
הפקולטה למדעי המחשב
הטכניון
The Bresenham algorithm draws lines and employs integer arithmetic. Further, many of its operations are increments and/or decrements by one, or multiplications by two (shift left in hardware). This makes it very simple to implement using assembly languages as well as in hardware. Virtually all computer graphics hardware nowadays implements some variant(s) of the Bresenham algorithm to draw lines (and more complex shapes like circles). See one implementation of the Bresenham algorithm for (dx > 0, dy > 0, dx > dy) lines, below.
