Grid Tools: Gridding Algorithms
When you grid a surface, a set of Z values from random X and Y locations, are passed through an algorithm that calculates Z values at all of the X and Y locations in an ordered grid. Most gridding algorithms attempt to assign values that approach the known Z values of the input data. The available algorithms (Minimum Curvature, Radial Search, Radial Search (Clustered), and Weighted Resampling), differ primarily in the way that the calculated grid node values are assigned in the immediate neighborhood of the input data. The way these algorithms are applied is controlled by the Gridding Parameters.
There are three steps involved in generating values at grid nodes:

Use the table below to help you determine the appropriate gridding algorithm.
Sparse Data | Dense Data | Fault Polygons Present | |
Minimum Curvature | X | X | |
Radial Search | X | X | |
Weighted Average | X |
— MORE INFORMATION
Copyright © 2020 | SeisWare International Inc. | All rights reserved |