Auto-adaptive step straight-line algorithm

Abstract

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.