Line Drawing and Leap Years

 

Abstract

Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization. We compare the two calculations.  We also discuss the connection of the leap year/line pattern with integer division and Euclid's algorithm for computing the greatest common divisor.