Line drawing, leap years, and Euclid

  • Authors:
  • Mitchell A. Harris;Edward M. Reingold

  • Affiliations:
  • Technical University of Dresden, Dresden, Germany;Illinois Institute of Technology, Chicago, IL

  • Venue:
  • ACM Computing Surveys (CSUR)
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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.