Grids

<< Click to Display Table of Contents >>

Navigation:  Chapter 10 Gridding and Contouring > Contour Maps > Editing a Contour Map >

Grids

Previous pageReturn to chapter overviewNext page

Gridding is a method for interpolating data values at regularly spaced locations (nodes) from irregularly spaced data. This is done using a variety of interpolation (gridding) algorithms. Most contouring algorithms require regularly spaced values to generate a contour maps.

 

There are a wide variety of gridding algorithms and the most suitable one is typically dependent on the data and the goal of the contouring. Currently, GaeaSynergy supports 6 gridding algorithms: Natural Neighbor, Inverse Distance, Modified Sheppard, Minimum Curvature, Trend Surface, and Nearest Neighbor. These algorithms are explained in more detail in the Gridding Algorithms section below.