PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 1, 1989ACM Transactions on Graphics283 citationsOpen Access

Discrete smooth interpolation

JMJean‐Laurent Mallet

Key Points

Key points are not available for this paper at this time.

Abstract

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)).

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Jean‐Laurent Mallet (1989) studied this question.

synapsesocial.com/papers/6a1be881fc87fd06169cea35https://doi.org/10.1145/62054.62057
Ask AI
Helpful
Bookmark
Share
View Full Paper