By Topic

Auto-adaptive step straight-line algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
V. Boyer ; Paris VIII Univ., France ; J. -J. Bourdin

One of the main functions of graphic displays is drawing straight lines. To draw lines quickly, the speed of the applied algorithm is critical. The following three different approaches exist: discrete differential analysis (DDA), introduced by Bresenham (1965), combinatory analysis, and linguistic methods. The most famous approach remains the DDA, since extended by N-step algorithms. We focus on this class of algorithms. Since three N-step algorithms have been published, we analyzed them, studying only their time complexity because they compute the same approximation of the continuous line. Our analysis shows that improvements are small and don't support our objectives for speed. We propose a new algorithm that uses other properties, some of them already presented. We also compare the performances of these algorithms and present the theoretical analysis and benchmarks that prove the new algorithm is at least twice as fast as earlier ones

Published in:

IEEE Computer Graphics and Applications  (Volume:20 ,  Issue: 5 )