DocumentCode :
1931087
Title :
An efficient line algorithm
Author :
Khalid, A. T M Shafiqul ; Kaykobad, M.
Author_Institution :
Ascent Solutions Inc., Dayton, OH, USA
Volume :
3
fYear :
1996
fDate :
18-21 Aug 1996
Firstpage :
1280
Abstract :
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
Keywords :
computational complexity; computer graphics; data structures; Bresenham´s algorithm; clock cycles; computational time; computer graphics; data structure; high resolution devices; line algorithm; raster device; Application software; Clocks; Computer graphics; Computer science; Data engineering; Data structures; Engineering drawings; Fractals; Roundoff errors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1996., IEEE 39th Midwest symposium on
Conference_Location :
Ames, IA
Print_ISBN :
0-7803-3636-4
Type :
conf
DOI :
10.1109/MWSCAS.1996.593157
Filename :
593157
Link To Document :
بازگشت