ACM Home Page
Please provide us with feedback. Feedback
Discrete smooth interpolation
Full text PdfPdf (1.37 MB)
Source ACM Transactions on Graphics (TOG) archive
Volume 8 ,  Issue 2  (April 1989) table of contents
Pages: 121 - 144  
Year of Publication: 1989
ISSN:0730-0301
Author
Jean-Laurent Mallet  Centre de Recherche en Informatique de Nancy and Ecole Nationale Superieure de Geologie, Vandoeuvre-les-Nancy, France
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 115,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/62054.62057
What is a DOI?

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


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
BRIGGS, I.C. Machine contouring using minimum curvature. Geophysics 17, 1 (1974).
 
5
DUBRULE, O., AND KOSTOV, C. An interpolation method taking into account inequality constraints: I. Methodology. Math. Geol. 18, 1 (1986), 33-51.
 
6
DUCHON, J. l~bnctions Splines du Type Plaque Mince en Dimension 2. S6minaire d'analyse num6rique, n 2:31, U.S.M.G., Grenoble, 1975.
 
7
ENRIQUEZ, J., THOMANN, J., AND GOUPILLOT, M. Application ofbidimensional spline functions to geophysics. Geophysics 48, 9 (1983).
 
8
 
9
G,LI~, P. E., MURRAY(, W., AND WRIGHT, M.H. Practical Optimisation. Academic Press, New York, 1981.
 
10
GOLUB, G., AND LOAN, V. Matrix Computation. The Johns Hopkins University Press, Baltimore, Md., 1983.
11
 
12
JOURNEI,, A.G. Constrained interpolation and qualitative information. The soft kriging approach. Math. Geol. 18, 3 (1986), 269-286.
 
13
JOURNEI., A. G., AND HUIJBREGTS, C. J. Mining Geostatisties. Academic Press, New York, 1978.
 
14
KOSTOV, C., AND DUBRULE, O. An interpolation method taking into account inequality constraints: II. Practical Approach. Math. Geol. I8, 2 (1986), 53-73.
 
15
LUENBERGER, D. G. Introduction to Linear and Non Linear Programming. Addison-Wesley, Reading, Mass., 1973.
 
16
MALI,ET, J.L. Automatic contouring in presence of discontinuities. Geostatistics for Natural Resources Characterization, Part 2, G. Verly, M. David, A. G. Jourmel, and M. Marechal, Eds. Reidel, Hingham, Mass., 1984, 669-677.
 
17
MALLET, J. L., JACQUEMIN, P., AND ROYER, J.J. Interactive computer aided design in the processing of mining and geological data. In The Role o1' Data in Scientific Progress, CODA TA 1985, P. F. Glaeser, Ed. Elsevier North-Holland, New York, pp. 19-24.
 
18
MATHERON, G. Les Variables R@ionalis~es et Leur Estimation. Masson, Paris, 1965.
 
19
MATHERON, (}. Spline and kriging, their formal equivalence. Geol. Contrib. (Syracuse Univ.) (198I).
 
20
21
 
22
YOUNG, D.M. Iterative Solution of Large Linear Systems. Academic Press, New York, 1971.

CITED BY  12


REVIEW

"Richard Franke : Reviewer"

This paper gives a method for constructing a grid of points from scattered data; in the examples, though, the author assumes that the data points are a subset of the grid points. The grid values minimize a certain discrete pseudonorm; this proce  more...

Collaborative Colleagues:
Jean-Laurent Mallet: colleagues