Title of article
Line drawing, leap years, and Euclid
Author/Authors
Harris، Mitchell A. نويسنده , , Reingold، Edward M. نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
-67
From page
68
To page
0
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, 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.
Keywords
Milk-market development , Revised Tobit procedure
Journal title
ACM Computing Surveys
Serial Year
2004
Journal title
ACM Computing Surveys
Record number
101333
Link To Document