<title>Fast line drawing algorithm by circular subtraction based on Bresenham</title>

Abstract

ABSTRACT The aim of this paper is to provide the line drawing algor ithm which is accurate and eff ective in dissimilar hardware platforms and different application requirements. The most famous algorithm to draw a straightness line in a smooth fashion is Bresenham algorithm. It is advantageous that the classic Bresenham algorithm processes are all integer numeric without division and decimal frac tion. Meanwhile, it is imperfect that the algorithm generates only one pixel at a computation time. So a common inevitable phenomenon of the algorithm is its slow efficiency to some extend. Firstly, this paper fully analyzes recent researches of the Bresenham Line Drawing algorithm. Secondly, in this paper we give full attention to the initiative relation between line generation model and its linear slope, and then we present an improved algorithm which can generate pixels of a line row-major by raster graphics display device. What needs to stress, the core principle of the improved algorithm is utiliz ing the counterpart of both ends of line and the symmetry for segments. Thirdly, after discussing theory and structure, the improved algorithm implementation and simulation are given. The corresponding project, it means that the hardware acceleration in the us e of circular subtraction technology based on shift register was briefly described. Finally, results were presented to demonstrate that the new algorithm inherits the advantage of classic Bresenham algorithm without division and decimal fraction, the speed has been increased greatly, and it is eas y to implement by hardware. Keywords: Computer graphics; Bresenham algorithm; line drawing