This is the authors' abstract. We don't add key points for this paper.
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 O(n log n), which is the same as the lower-bound on the cost of continuous linear interpolation procedures.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Rovatti et al. (1998) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: