Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Pitteway:1982:BAR,
author = "M. L. V. Pitteway and A. J. R. Green",
title = "{Bresenham}'s Algorithm with Run Line Coding
Shortcut",
journal = j-COMP-J,
volume = "25",
number = "1",
pages = "114--115",
month = feb,
year = "1982",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/25.1.114",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:12 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/25/1.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/25/1/114.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/tiff/114.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/tiff/115.tif",
acknowledgement = ack-nhfb,
classcodes = "C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci., Brunel Univ., Uxbridge, UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "approximation; arbitrary gradient; best fit;
Bresenham's algorithm; continued fraction expansion;
diagonal move; encoding; Euclid's algorithm;
incremental plotters; output; run line coding;
shortcut; square move; straight lines; string",
treatment = "P Practical",
}