This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Geometric Approach to Maximum-Speed n-Dimensional Continuous Linear Interpolation in Rectangular Grids
August 1998 (vol. 47 no. 8)
pp. 894-899

Abstract—An algorithm for the linear interpolation of multi-input functions sampled on rectangular grids is presented. A geometric approach is adopted and the mathematics is thoroughly developed. We show that the algorithm is optimum. In fact, when the number n of inputs grows to infinity its computational requirement is ${\cal O}(n {\rm\ log}\ n),$ which is the same as the lower-bound on the cost of continuous linear interpolation procedures.

[1] A.S. Noetzel, "An Interpolating Memory Unit for Function Evaluation: Analysis and Design," IEEE Trans. Computers, vol. 38, no. 3, pp. 377-384, Mar. 1997.
[2] E. Pearse O'Grady and B.K. Young, "A Hardware-Oriented Algorithm for Floating-Point Function Generation," IEEE Trans. Computers, vol. 40, pp. 237-241, 1991.
[3] H.M. Aus and G.A. Korn, "Table-Lookup/Interpolation Function Generation for Fixed-Point Digital Computations," IEEE Trans. Computers, vol. 18, pp. 745-749, 1969.
[4] G.H. Garcia and W.J. Kubitz, "Minimum Mean Running Time Function Generation Using Read-Only Memory," IEEE Trans. Computers, vol. 32, pp. 147-156, 1983.
[5] C.H. Choi and J.Y. Choi, "Constructive Neural Networks with Piecewise Interpolation Capabilities for Function Approximation," IEEE Trans. Neural Networks, vol. 5, pp. 936-944, 1994.
[6] C. Kahlert and L.O. Chua, "The Complete Canonical Piecewise-Linear Representation—Part I: The Geometry of the Domain Space," IEEE Trans. Circuits and Systems, vol. 39, pp. 222-236, 1992.
[7] G. Strang and G. Fix, An Analysis of the Finite Element Method.Englewood Cliffs, N.J.: Prentice Hall, 1973.
[8] P.S. Mara, "Triangulation for the Cube," J. Combinatorial Theory (A), vol. 20, pp. 170-177, 1976.
[9] R.W. Cottle, "Minimal Triangulation of the 4-Cube," Discrete Mathematics, vol. 40, pp. 25-29, 1982.
[10] J.F. Sallee, "A Triangulation of the n-Cube," Discrete Mathematics, vol. 40, pp. 81-86, 1982.
[11] J.F. Sallee, "Middle-Cut Triangulations of the n-Cube," SIAM J. Algebraic and Discrete Methods, vol. 5, pp. 407-419, 1984.
[12] M. Haiman, "A Simple and Relatively Efficient Triangulation of the n-Cube," Discrete Computational Geometry, vol. 6, pp. 287-289, 1991.
[13] G. Katona, "Combinatorial Search Problems," CISM Courses and Lectures, n0. 145, Springer Verlag, 1972.
[14] T.M. Cover and J.A. Thomas, Elements of Information Theory. John Wiley&Sons, 1991.
[15] R. Bellman, Introduction to Matrix Analysis.New York: McGraw-Hill, 1960.
[16] E. Snapper and R.J. Troyer, Metric Affine Geometry.New York: Academic Press, 1971.

Index Terms:
Computational multidimensional geometry, high-speed function generation, piecewise-linear interpolation.
Citation:
Riccardo Rovatti, Michele Borgatti, Roberto Guerrieri, "A Geometric Approach to Maximum-Speed n-Dimensional Continuous Linear Interpolation in Rectangular Grids," IEEE Transactions on Computers, vol. 47, no. 8, pp. 894-899, Aug. 1998, doi:10.1109/12.707591
Usage of this product signifies your acceptance of the Terms of Use.