Generalization of Line Drawing Algorithm – An effective approach to minimize the error in the existing Bresenham’s Line Drawing Algorithm

The present paper focuses on effective approach to minimize the error in the existing Bresenham's Line Drawing Algorithm (BLDA) in computer graphics. In this method, we consider three different values of h, i.e., 1, 0.5 and 0.1. For h=1, all the results of BLDA have been verified and for other values of h it is observed that as the value of h decreases, the number of iteration increases and the error between the points generated and the original line points decreases and vice-versa.