Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1145/1013208.1013211 | ACM Comput. Surv. |
Keywords | Field | DocType |
leap years,euclid's algorithm,scan-line conversion,bresenham's algorithm,integer division,calendar algorithms,algorithm minimizes error,greatest common divisor,leap year calculation,line pattern,leap year,integer grid point,line drawing,continued fractions,continued fraction | Integer,Leap year,Computer science,Arithmetic,Algorithm,Integer division,Bresenham's line algorithm,Theoretical computer science,Greatest common divisor,Grid,Line drawings | Journal |
Volume | Issue | ISSN |
36 | 1 | 0360-0300 |
Citations | PageRank | References |
3 | 0.58 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mitchell A. Harris | 1 | 8 | 2.32 |
| Edward M. Reingold | 2 | 2214 | 563.65 |