Discrete smooth interpolation - Archive ouverte HAL Access content directly
Journal Articles ACM Transactions on Graphics Year : 1989

Discrete smooth interpolation


Interpolation of a function ƒ (.) known at some data points of R P is a common problem. Many computer applications (e.g., automatic contouring) need to perform interpolation only at the nodes of a given grid. Whereas most classical methods solve the problem by finding a function defined everywhere, the proposed method avoids explicitly computing such a function and instead produces values only at the grid points. For two-dimensional regular grids, a special case of this method is identical to the Briggs method (see “Machine Contouring Using Minimum Curvature,” Geophysics 17 , 1 (1974)), while another special case is equivalent to a discrete version of thin plate splines (see J. Duchon, Fonctions Splines du type Plaque Mince en Dimention 2 , Séminaire d'analyse numérique, n 231, U.S.M.G., Grenoble, 1975; and J. Enriquez, J. Thomann, and M. Goupillot, Application of bidimensional spline functions to geophysics, Geophysics 48 , 9 (1983)).

Dates and versions

hal-04025873 , version 1 (13-03-2023)



Jean-Laurent Mallet. Discrete smooth interpolation. ACM Transactions on Graphics, 1989, 8 (2), pp.121-144. ⟨10.1145/62054.62057⟩. ⟨hal-04025873⟩
0 View
0 Download



Gmail Facebook Twitter LinkedIn More