Line drawing, leap years and euclid

ACM Computing Surveys

Volumn 36, Issue 1, 2004, Pages 68-80

  Harris, Mitchell A ^a   Reingold, Edward M ^b,c  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b ILLINOIS INSTITUTE OF TECHNOLOGY   (United States)

^c Illinois Institute of Technology   (United States)

Author keywords

Bresenham's algorithm; Calendar algorithms; Continued fractions; Euclid's algorithm; Greatest common divisor; Leap years; Line drawing; Scan line conversion

Indexed keywords

BRESENHAM'S ALGORITHMS; CALENDER ALGORITHMS; CONTINUED FRACTIONS; EUCLID'S ALGORITHMS; GREATEST COMMON DIVISORS; LEAP YEARS; LINE DRAWING; SCAN LINE CONVERSION;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; IMAGE PROCESSING; PROBLEM SOLVING;

COMPUTER GRAPHICS;

EID: 4344679090     PISSN: 03600300     EISSN: None     Source Type: Journal    
DOI: 10.1145/1013208.1013211     Document Type: Review

References (14)

1. ALLOUCHE, J.-P. AND SHALLIT, J. 2003. Automatic Sequences. Cambridge University Press, Cambridge, U.K.
2. BERSTEL, J. 1990. Tracé de droites, fractions continues et morphismes itérés. In Mots: Mélanges Offerts à M.-P. Schützenberger, M. Lothaire, Ed. Editions Hermès, Paris, France, 298-309.
3. BEESENHAM, J. E. 1965. Algorithm for computer control of a digital plotter. IBM Syst. J. 4, 1, 25-30.
4. BRONS, R. 1974. Linguistic methods for the description of a straight line on a grid. Comput. Graph. Image Process. 3, 1, 48-62.
5. CASTLE, C. M. A. AND PITTEWAY, M. L. V. 1987. An efficient structural technique for encoding 'best-fit' straight lines. Comput. J. 30, 2, 168-175.
6. FRAENKEL, A. S., MUSHKIN, M., AND TASSA, U. 1978. Determination of [nθ] by its sequence of differences. Can. Math. Bull. 21, 441-446.
7. GRAHAM, R. L., KNUTH, D. E., AND PATASHNIK, O. 1994. Concrete Mathematics, 2nd ed. Addison-Wesley, Reading, MA.
8. KNUTH, D. E. 1998. The Art of Computer Programming (Volume 2: Seminumerical Algorithms'), 3rd ed. Addison-Wesley, Reading, MA.
9. PITTEWAY, M. L. V. 1985. The relationship between Euclid's algorithm and run-length encoding. In Fundamental Algorithms for Computer Graphics, R. A. Earnshaw, Ed. Springer, Berlin, Germany, 105-111.
10. REINGOLD, E. M. AND DERSHOWITZ, N. 2001. Calendrical Calculations: The Millennium Edition. Cambridge University Press, Cambridge, U.K.
11. ROCKETT, A. M. AND SZÜSK, P. 1992. Continued Fractions. World Scientific, Singapore.
12. SHALLIT, J. 1994. Pierce expansions and rules for the determination of leap years. Fibonacci Quart. 32, 5, 416-423.
13. SPROULL, R. F. 1982. Using program transformations to derive line-drawing algorithms. ACM Trans. Graph. 1, 4, 259-273.
14. TROESCH, A. 1998. Droites discrètes et calendriers. Math. Inform, et Sci. Humaines 141, 36, 11-41.