Line drawing, leap years, and Euclid
Mitchell A. Harris, Edward M. Reingold · ACM Computing Surveys · 2004
Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization. We compare the two calculations, explicate the pattern, and discuss the connection of the leap year/line pattern with integer division and Euclid's algorithm for computing the greatest common divisor.