Wouldn't the exception be for lines whose slope is irrational? (i.e. that can't be represented by a ratio of integers), so the repeating pattern is analogous to the repeating pattern in a decimal representation of a rational number.
How does a computer distinguish an irrational number from a good, (necessarily rational) floating-point approximation of one?
The algorithm only works with points with integer coordinates, so the slope is always rational.
Re:The Beauty of Bresenham's Algorithm
by FredBrach on Wednesday August 08, 2012 @12:43AM
(#4353950)
I think you have the last words because line drawing algorithms become irrelevant if you use a Floating Point Unit.
just:
{ x++ and y+=slope } or { y++ and x+= 1./slope }
Then slopes are always rational in line drawing algorithms.
His discrete line equation is relatively beautiful (it is easily extractible from Bresenham's algorithm however): 0 ≤ ax − by < ω