Thumbnail
Access Restriction
Subscribed

Author Harris, Mitchell A. ♦ Reingold, Edward M.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2004
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Bresenham's algorithm ♦ Euclid's algorithm ♦ Calendar algorithms ♦ Continued fractions ♦ Greatest common divisor ♦ Leap years ♦ Line drawing ♦ Scan-line conversion
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.
ISSN 03600300
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2004-03-01
Publisher Place New York
e-ISSN 15577341
Journal ACM Computing Surveys (CSUR)
Volume Number 36
Issue Number 1
Page Count 13
Starting Page 68
Ending Page 80


Open content in new tab

   Open content in new tab
Source: ACM Digital Library