TY  - JOUR
T1  - An Improved Algorithm for Scan-converting a Line
AU - , Md. Hasanul Kabir AU - , Md. Imrul Hassan AU - , Abdullah Azfar 
JO  - Asian Journal of Information Technology
VL  - 4
IS  - 9
SP  - 835
EP  - 839
PY  - 2005
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2005.835.839
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2005.835.839
KW  - 
AB  - For scan-converting a line, Bresenham’s Line Algorithm is an efficient incremental method. In this study, presented an improved algorithm over the Bresenham’s Algorithm for line scan-conversion. Depending on the slope of the line, we computed up to which point the line is going to have a unique increasing/decreasing pattern in one of the directions while there are unit increments in the other direction. Then we have used this increasing/decreasing pattern to draw the remaining pixels of the line without the need of checking the sign of the decision variable for pixel choice. The difference with the Bresenham’s Line Algorithm is, in that algorithm, for pixel choosing, we had to decide till to the other end point of the line, but in present algorithm we only have to decide up to a portion of that line and then we can continue drawing pixels without decision making.
ER  -