An efficient line algorithm

We present a new algorithm for drawing lines in a raster device in which a suitable data structure has been chosen to avoid comparisons that are required, for example, in Bresenham's algorithm. Experimental results as well as clock cycles calculated theoretically suggest that this new algorithm outperforms the ones currently existing in the literature in terms of computational time. Our experimental results also suggest that quality of the line does not deteriorate even when high resolution raster devices are used.