Bresenhams line drawing algorithm

Question

Describe the Bresenhams line drawing algorithm in brief?

Answer 1

In Bresenham’s approach the pixel position all along the line path is determined by the sampling unit X intervals. Beginning from the left end point(X0, Y0) of a given line we step to all successive columns and plot the pixel whose scan line Y-value is nearest to the line path. Supposing the Kth step in procedure, found out that the pixel at (X_k, Y_k) decide which pixel to plot in the column X_k+1. Choices are (X_k+1, Y_k) and (X_k+1, Y_k+1)