Line Drawing, Leap Years and Euclid.

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 alg...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	ACM computing surveys. 36, 1 (2004).
1. Verfasser:	Harris, Mitchell
Weitere Verfasser:	Reingold, Edward M.
Format:	Artikel
Sprache:	English
Schlagworte:	Bresenham's algorithm. Euclid's algorithm. Calendar algorithms. Continued fractions. Greatest common divisor. Leap years. Line drawing. Scan line conversion.