“…In Bresenham's algorithm, the next point is obtained by checking the sign of error, and only integer computation is used in inner loop calculating. With regard to Bresenham's middle algorithm, there are many fast algorithms and implementations, such as in [2], [3], [4], [5], [6], [7], and [8]. Some of these methods emphasize on the distribution of line's direction; others require that the line drawn is not to be very short.…”