Double- and triple-step incremental linear interpolation

Author

Graham, Phil ; Iyengar, S. Sitharama

Author_Institution

Louisiana State Univ., Baton Rouge, LA, USA

Volume

14

Issue

3

fYear

1994

fDate

5/1/1994 12:00:00 AM

Firstpage

49

Lastpage

53

Abstract

Incremental linear interpolation determines the set of n+1 equidistant points on an interval [a,b] where all variables involved (n, a, b, and the set of equidistant points) are integers and n>0. Our method of linear interpolation generalizes the findings of a variable-step line-drawing algorithm. The resulting interpolation algorithm has as many loops as the line-drawing algorithm, but fewer restrictions on its input variables. Furthermore, its benefits over the fixed-step interpolation algorithms are similar to those of the variable-step line-drawing algorithm. That is, the double- and triple-step interpolation algorithm can reduce the number of loop iterations of the double-step interpolation algorithm (by 12.5% on average) while keeping the code complexity, initialization costs, and worst-case performance the same. The improvement in speed over the single-step B5 algorithm is even greater.<>

Keywords

computational complexity; interpolation; iterative methods; B5 algorithm; code complexity; double-step interpolation algorithm; equidistant points; incremental linear interpolation; initialization costs; input variable restrictions; loop iterations; triple-step interpolation algorithm; variable-step line-drawing algorithm; worst-case performance; Algorithm design and analysis; Application software; Computational modeling; Computer graphics; Computer simulation; Costs; Hardware; Interpolation; Logic;

fLanguage

English

Journal_Title

Computer Graphics and Applications, IEEE

Publisher

ieee

ISSN

0272-1716

Type

jour

DOI

10.1109/38.279045

Filename

279045