Algorithm for the production of contour maps from linearized data

Ewen-Smith, B.M.. 1971 Algorithm for the production of contour maps from linearized data. Nature, 234 (5323). 33-34. 10.1038/234033a0

Full text not available from this repository. (Request a copy)

Official URL: http://dx.doi.org/10.1038/234033a0

Abstract/Summary

Cole has proposed an algorithm which produces a generalized surface for contouring scattered data1. The algorithm works well when the data points are randomly distributed but improbable results have been obtained when the data points are distributed along lines. There are two reasons for this: one is the extrapolations which occur into regions without data and the other is the generation of unlikely gradients across the lines. Measurements of many geophysical properties, made by moving vehicles, ships and so on, are often distributed along lines which are not necessarily straight. They may cross one another but the distance between adjacent measurements on the lines is usually much less than the distance between the lines. Such a distribution of measurement points may be found in other situations where the two dimensions are not spatial.

Item Type:	Publication - Article
Digital Object Identifier (DOI):	10.1038/234033a0
ISSN:	0028-0836
NORA Subject Terms:	Mathematics
Date made live:	15 Jan 2020 08:53 +0 (UTC)
URI:	https://nora.nerc.ac.uk/id/eprint/526474

Item Type:

Publication - Article

Digital Object Identifier (DOI):

10.1038/234033a0

ISSN:

0028-0836

NORA Subject Terms:

Mathematics

Date made live:

15 Jan 2020 08:53 +0 (UTC)

URI:

https://nora.nerc.ac.uk/id/eprint/526474