Bresenham Line Generation Algorithm
This algorithm is exact and efficient raster line generation algorithm. Such algorithm scan converts lines utilizing only incremental integer calculations and such calculations can also be adapted to exhibit circles and the other curves.
Figure: Bresenham line generation
Sampling at Unit x distance as in above figure of Bresenham line generation, we require to decide that of the two probable pixel position is closer to the line path at all sample steps.
In line1: we require to decide that at subsequent sample position where to plot the pixel at position as (11, 11) or at position (11, 12).
Likewise, In line2: the subsequent pixel has to be (11, 13) or be (11, 12) or what option of pixel is to be done to draw a line is specified by Bresenham, through testing the sign of the integer parameter that value is proportional to the dissimilarity among the separation of the two pixel positions from definite line path. In this part, we will discuss this algorithm for positive slope (0 < m < 1). If the slope is -ive then, utilize reflection transformation to transform the line segment along with negative slope to line segment along with positive slope. So this time, let us discuss the generation of line one more time in two situations as in the case of Digital Differential Analyzer line generation.