This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Auto-Adaptive Step Straight-Line Algorithm
September/October 2000 (vol. 20 no. 5)
pp. 67-69
ASCII Text
x 
 
Vincent Boyer, Jean-Jacques Bourdin, "Auto-Adaptive Step Straight-Line Algorithm," IEEE Computer Graphics and Applications, vol. 20, no. 5, pp. 67-69, September/October, 2000.
 
 
BibTex
x
 
@article{ 10.1109/38.865882,
author = {Vincent Boyer and Jean-Jacques Bourdin},
title = {Auto-Adaptive Step Straight-Line Algorithm},
journal ={IEEE Computer Graphics and Applications},
volume = {20},
number = {5},
issn = {0272-1716},
year = {2000},
pages = {67-69},
doi = {http://doi.ieeecomputersociety.org/10.1109/38.865882},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - MGZN
JO - IEEE Computer Graphics and Applications
TI - Auto-Adaptive Step Straight-Line Algorithm
IS - 5
SN - 0272-1716
SP67
EP69
EPD - 67-69
A1 - Vincent Boyer,
A1 - Jean-Jacques Bourdin,
PY - 2000
KW - [Computer Graphics] Line Approximation
KW - Algorithms
KW - Picture/Image Generation
KW - Incremental Curve Generation
KW - Line Generators.
VL - 20
JA - IEEE Computer Graphics and Applications
ER -
 
The drawing of straight lines remains a major field in computer graphics. Research tends to speed up the computations. In this article we analyze the most recent class of algorithms (the N-step). Each N-step algorithm suffers from a major flaw: the choice of N is made once and for all the lines. This article presents a new algorithm that chooses the N value automatically. The analysis and benchmarks prove that the new algorithm is at least two times faster than the fastest existing one.

1. J.E. Bresenham, "Algorithm for Computer Control of a Digital Plotter," IBM System J., Vol. 4, No. 1, 1965, pp. 25-30.
2. C.M.A. Castle and M.L.V. Pitteway, "An Application of Euclid's Algorithm to Drawing Straight Lines," Fundamental Algorithms in Computer Graphics, Springer-Verlag, Berlin, 1985, pp. 135-139.
3. R. Brons, "Linguistic Methods for Description of a Straight Line on a Grid," Computer Graphics and Image Processing (CGIP), Vol. 3, 1974, pp. 48-62.
4. L. Wu, "On the Chain Code of a Line," IEEE Trans. Patterns Analysis and Machine Intelligence (PAMI), Vol. 4, No. 3, 1982, pp. 347-353.
5. J.G. Rokne et al., "Fast Line Scan-Conversion," ACM Trans. Graphics, vol. 9, no. 4, Oct. 1990, pp. 376-388.
6. P. Graham and S.S. Iyengar, "Double- and Triple-Step Linear Interpolation," IEEE CG&A, Vol. 14, No. 3, 1994, pp. 49-53.
7. G.W. Gill, "N-Step Incremental Straight-Line Algorithms," IEEE Computer Graphics&Applications, vol. 5, no. 3, May 1994, pp. 66-72.
8. V. Boyer and J.-J. Bourdin, "Fast Lines: a Span by Span Method," Proc. Eurographics 99, Computer Graphics Forum Series, Blackwell Publishers, Oxford, U.K., Vol. 18, No. 3, Sept. 1999, pp. 377-384.

Index Terms:
[Computer Graphics] Line Approximation, Algorithms, Picture/Image Generation, Incremental Curve Generation, Line Generators.
Citation:
Vincent Boyer, Jean-Jacques Bourdin, "Auto-Adaptive Step Straight-Line Algorithm," IEEE Computer Graphics and Applications, vol. 20, no. 5, pp. 67-69, Sept.-Oct. 2000, doi:10.1109/38.865882
Usage of this product signifies your acceptance of the Terms of Use.