
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Riccardo Rovatti, Michele Borgatti, Roberto Guerrieri, "A Geometric Approach to MaximumSpeed nDimensional Continuous Linear Interpolation in Rectangular Grids," IEEE Transactions on Computers, vol. 47, no. 8, pp. 894899, August, 1998.  
BibTex  x  
@article{ 10.1109/12.707591, author = {Riccardo Rovatti and Michele Borgatti and Roberto Guerrieri}, title = {A Geometric Approach to MaximumSpeed nDimensional Continuous Linear Interpolation in Rectangular Grids}, journal ={IEEE Transactions on Computers}, volume = {47}, number = {8}, issn = {00189340}, year = {1998}, pages = {894899}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.707591}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Geometric Approach to MaximumSpeed nDimensional Continuous Linear Interpolation in Rectangular Grids IS  8 SN  00189340 SP894 EP899 EPD  894899 A1  Riccardo Rovatti, A1  Michele Borgatti, A1  Roberto Guerrieri, PY  1998 KW  Computational multidimensional geometry KW  highspeed function generation KW  piecewiselinear interpolation. VL  47 JA  IEEE Transactions on Computers ER   
Abstract—An algorithm for the linear interpolation of multiinput 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
[1] A.S. Noetzel, "An Interpolating Memory Unit for Function Evaluation: Analysis and Design," IEEE Trans. Computers, vol. 38, no. 3, pp. 377384, Mar. 1997.
[2] E. Pearse O'Grady and B.K. Young, "A HardwareOriented Algorithm for FloatingPoint Function Generation," IEEE Trans. Computers, vol. 40, pp. 237241, 1991.
[3] H.M. Aus and G.A. Korn, "TableLookup/Interpolation Function Generation for FixedPoint Digital Computations," IEEE Trans. Computers, vol. 18, pp. 745749, 1969.
[4] G.H. Garcia and W.J. Kubitz, "Minimum Mean Running Time Function Generation Using ReadOnly Memory," IEEE Trans. Computers, vol. 32, pp. 147156, 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. 936944, 1994.
[6] C. Kahlert and L.O. Chua, "The Complete Canonical PiecewiseLinear Representation—Part I: The Geometry of the Domain Space," IEEE Trans. Circuits and Systems, vol. 39, pp. 222236, 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. 170177, 1976.
[9] R.W. Cottle, "Minimal Triangulation of the 4Cube," Discrete Mathematics, vol. 40, pp. 2529, 1982.
[10] J.F. Sallee, "A Triangulation of the nCube," Discrete Mathematics, vol. 40, pp. 8186, 1982.
[11] J.F. Sallee, "MiddleCut Triangulations of the nCube," SIAM J. Algebraic and Discrete Methods, vol. 5, pp. 407419, 1984.
[12] M. Haiman, "A Simple and Relatively Efficient Triangulation of the nCube," Discrete Computational Geometry, vol. 6, pp. 287289, 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: McGrawHill, 1960.
[16] E. Snapper and R.J. Troyer, Metric Affine Geometry.New York: Academic Press, 1971.