Line drawing algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Line drawing algorithm" in English language version.

refsWebsite
Global rank English rank
5th place
5th place
low place
low place
low place
7,391st place

iit.edu

emr.cs.iit.edu

  • Mitchell A. Harris, Edward M. Reingold: Line drawing, leap years, and Euclid. ACM Computing Surveys 36, 1 (March 2004): 68–80, ISSN 0360-0300 (Archived 16 December 2006 at emr.cs.iit.edu (Error: unknown archive URL))

univ-paris8.fr

ai.univ-paris8.fr

  • Vincent Boyer, Jean-Jacques Bourdin: Fast Lines: a Span by Span Method. Computer Graphics Forum 18, 3 (1999): 377–384 (Archived 23 April 2024 at ai.univ-paris8.fr (Error: unknown archive URL))

worldcat.org

  • Robert F. Sproull: Using program transformations to derive line-drawing algorithms. ACM Transactions on Graphics 1, 4 (October 1982): 259–273, ISSN 0730-0301
  • Chengfu Yao, Jon G. Rokne: An integral linear interpolation approach to the design of incremental line algorithms. Journal of Computational and Applied Mathematics 102, 1 (February 1999): 3–19, ISSN 0377-0427
  • Mitchell A. Harris, Edward M. Reingold: Line drawing, leap years, and Euclid. ACM Computing Surveys 36, 1 (March 2004): 68–80, ISSN 0360-0300 (Archived 16 December 2006 at emr.cs.iit.edu (Error: unknown archive URL))