Line Drawing, Leap Years, and Euclid

From International Center for Computational Logic

Toggle side column

Line Drawing, Leap Years, and Euclid

Mitchell A. HarrisMitchell A. Harris,  Edward R. ReingoldEdward R. Reingold
Mitchell A. Harris, Edward R. Reingold
Line Drawing, Leap Years, and Euclid
ACM Computing Surveys, 36:68-80, 2004
  • KurzfassungAbstract
    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.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@article{ Harris-ACMCS2004,
  author = {Mitchell A. {Harris} and Edward R. {Reingold}},
  journal = {ACM Computing Surveys},
  pages = {68--80},
  title = {Line {D}rawing, {L}eap {Y}ears, and {E}uclid},
  volume = {36},
  year = {2004},
}