Line drawing, leap years, and Euclid-Reference-Cited by-同舟云学术

Line drawing, leap years, and Euclid

Published:2004-03 Issue:1 Volume:36 Page:68-80
ISSN:0360-0300
Container-title:ACM Computing Surveys
language:en
Short-container-title:ACM Comput. Surv.

Author:

Harris Mitchell A.¹,Reingold Edward M.²

Affiliation:

1. Technical University of Dresden, Dresden, Germany

2. Illinois Institute of Technology, Chicago, IL

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.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/1013208.1013211

Reference14 articles.

1. Allouche J.-P. and Shallit J. 2003. Automatic Sequences. Cambridge University Press Cambridge U.K. Allouche J.-P. and Shallit J. 2003. Automatic Sequences. Cambridge University Press Cambridge U.K.

2. Algorithm for computer control of a digital plotter;Bresenham J. E.;IBM Syst. J.,1965

3. Linguistic methods for the description of a straight line on a grid;Brons R.;Comput. Graph. Image Process.,1974

4. An Efficient Structural Technique for Encoding 'Best-fit' Straight Lines

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. ON THE EUCLIDEAN ALGORITHM: RHYTHM WITHOUT RECURSION;Bulletin of the Australian Mathematical Society;2022-09-22

2. An Intelligent Instrument Reader: Using Computer Vision and Machine Learning to Automate Meter Reading;IEEE Industry Applications Magazine;2021-07

3. Generalization of Line Drawing Algorithm – An effective approach to minimize the error in the existing Bresenham’s Line Drawing Algorithm;2021 International Conference on Emerging Smart Computing and Informatics (ESCI);2021-03-05

4. Log-Ratio Analysis of Finite Precision Data: Caveats, and Connections to Digital Lines and Number Theory;Advances in Compositional Data Analysis;2021

5. The maximal energy of classes of integral circulant graphs;Discrete Applied Mathematics;2012-09