Discrete Smooth Interpolation

246Citations
Citations of this article
72Readers
Mendeley users who have this article in their library.

Abstract

Interpolation of a function ƒ(·) known at some data points of RP 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)). © 1989, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Mallet, J. L. (1989). Discrete Smooth Interpolation. ACM Transactions on Graphics (TOG), 8(2), 121–144. https://doi.org/10.1145/62054.62057

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free