Last update: Sun Oct 15 02:29:44 MDT 2017
@Article{Molla:2001:SA,
author = "Ram{\'o}n Moll{\'a} and Roberto Viv{\'o}",
title = "The Stair algorithm",
journal = j-J-GRAPHICS-TOOLS,
volume = "6",
number = "2",
pages = "17--25",
year = "2001",
CODEN = "JGTOFD",
ISSN = "1086-7651",
ISSN-L = "1086-7651",
bibdate = "Wed Feb 06 11:23:34 2002",
bibsource = "http://www.acm.org/jgt/issues.html;
http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib",
URL = "http://www.acm.org/jgt/papers/MollaVivo01.html",
abstract = "This algorithm draws straight lines on discrete
devices as if they were staircases. It determines the
fractional average length of each step, and it fills
the pixels along every scanline intersected by the line
to be drawn. This algorithm supports fractional line
ends, and it uses internal 32-bit, fixed-point
arithmetic; 16 bits for the integer and 16 bits for the
decimal part.",
acknowledgement = ack-nhfb,
journal-URL = "http://www.tandfonline.com/loi/ujgt20",
}