Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Incremental linear interpolation
Field D. ACM Transactions on Graphics (TOG)4 (1):1-11,1985.Type:Article
Date Reviewed: Jun 1 1986

By incremental linear interpolation, the author means the construction of a set of n + 1 equidistant points on an interval [a,b]. With integer arithmetic, the points are to be rounded to the nearest integer, as

x1 = :7Da + :4Fban i +:9- T:4F12:8D Such sets of equidistant points are used very extensively in computer graphics; hence, it is important to compute them efficiently. The author starts from a naive algorithm requiring floating-point arithmetic, and refines it through a sequence of stages to produce an efficient exact algorithm using only integer arithmetic and shifting, assuming twos-complement binary representation. This paper is an instructive exercise in the process of refining an algorithm. However, I fail to see any advantage in the replacement of descriptive identifiers by C1, C2, etc., in the final stage of refinement of the algorithm.

Reviewer:  G. J. Tee Review #: CR109869
Bookmark and Share
 
Interpolation (G.1.1 )
 
 
Display Algorithms (I.3.3 ... )
 
 
Error Analysis (G.1.0 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Interpolation": Date
Systolic computation of interpolating polynomials
Cappello P., Koç Ç., Gallopoulos E. Computing 45(2): 95-117, 2000. Type: Article
Jun 1 1991
Interpolation of data on the surface of a sphere
Renka R. (ed) ACM Transactions on Mathematical Software 10(4): 417-436, 1984. Type: Article
Nov 1 1985
Multivariate interpolation of large sets of scattered data
Renka R. (ed) ACM Transactions on Mathematical Software 14(2): 139-148, 1988. Type: Article
Mar 1 1989
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy