Subscribe

Issue No.05 - September/October (2000 vol.20)

pp: 67-69

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/38.865882

ABSTRACT

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.

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, September/October 2000, doi:10.1109/38.865882REFERENCES