Skip to main content

Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.

  • Letter
  • Published:

Algorithm for the Production of Contour Maps from Scattered Data

Abstract

THE production of contour maps from data measured at a set of points randomly scattered over some given region is a common problem. For example, geologists are interested in the production of trend surfaces and the associated contour maps from data consisting of the x,y map coordinates of bore locations and the corresponding depths below sea level at which a certain type of rock was found. Although the points at which data are available are not random, in general they are not at points of a rectangular grid. Similarly, for meteorological purposes, although the sites for weather stations can be chosen more rationally they are neither sufficiently dense nor precisely sited to form a complete grid. Many techniques have been used to produce grid values from the given data, most of which use either some triangulation method or else a local or global fit of polynomial or Fourier surfaces. James1 indicates some of the disadvantages of these methods, in particular the fact that in regression of either polynomial or two-dimensional Fourier series both represent finite expansions of infinite series with an increasing number of extrema and inflexions on further expansion. Both are linear with respect to their coefficients so they are both specific cases of the general linear model and thus are subject to the mathematical restrictions inherent in such models. James and Krumbein2 list those restrictions of importance geologically. James describes a method whereby a non-linear model in general mathematical terms is assigned as an educated guess based on the user's geological intuition. The method is iterative in the sense that the original model can be revised after further analysis of the residuals.

This is a preview of subscription content, access via your institution

Access options

Rent or buy this article

Prices vary by article type

from$1.95

to$39.95

Prices may be subject to local taxes which are calculated during checkout

Similar content being viewed by others

References

  1. James, W. R., Kansas Geol. Survey Computer Contr., 12, 26 (1967).

    Google Scholar 

  2. Krumbein, W. C., Office of Naval Research, Geography Branch, Tech. Report No. 2, ONR Task No. 388–078.

  3. Cole, A. J., and Davie, A. J. T., Computer J. (in the press).

  4. Lanczos, C., Applied Analysis (Pitman, 1957).

    MATH  Google Scholar 

  5. Hildebrand, F. B., Introduction to Numerical Analysis (McGraw-Hill, 1956).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

COLE, A. Algorithm for the Production of Contour Maps from Scattered Data. Nature 220, 92–94 (1968). https://doi.org/10.1038/220092a0

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1038/220092a0

This article is cited by

Comments

By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.

Search

Quick links

Nature Briefing

Sign up for the Nature Briefing newsletter — what matters in science, free to your inbox daily.

Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing