Bresenham’s Line Drawing Algorithm

Abstract: The basic principle of this algorithm is to select the optimum raster location to represent a straight line. To accomplish this algorithm always increments either x or y one unit depending on the slope of line. The increment in the other variable is determined by examining the distance between the actual line location and the nearest pixel. This distance is called decision variable or error.

Keywords: Pixel, Decision Variable, Error.