Gridding Algorithm
A gridding algorithm in petroleum geoscience and reservoir engineering is a computational procedure that assigns numerical values (porosity, depth, thickness, saturation, seismic amplitude, or any other spatial property) to the nodes or cells of a regular or irregular grid covering a geological surface or volume, by interpolating or extrapolating from the scattered point measurements available at well locations, seismic picks, core measurements, or other sample locations to the full spatial domain of the model, with the choice of algorithm governing the spatial pattern of interpolated values (the degree of smoothing, the preservation of directional trends, the handling of data anisotropy, the reproduction of input data values at sample locations, and the treatment of areas distant from control points where the grid values must be extrapolated without data support); the most commonly used gridding algorithms in subsurface mapping include minimum curvature (which fits the smoothest possible surface through the data), kriging (which uses the variogram to weight nearby samples and provides uncertainty estimates), inverse distance weighting (which weights samples by their proximity to the grid node), triangulation (which builds a surface directly from the triangulated network of sample points), and radial basis functions (which fit exact interpolants that honor all data points), each with characteristic behaviors that make them appropriate for different geological settings, data densities, and mapping objectives.
Key Takeaways
- Minimum curvature is the most widely used gridding algorithm in petroleum exploration mapping because it produces visually smooth surfaces that geologically resemble the continuous depositional or structural surfaces being mapped, minimizes artificial oscillations (bull's-eyes) around isolated data points, and is computationally efficient for large grids; minimum curvature works by finding the surface that minimizes the integral of the squared curvature (the second derivative of the surface) subject to the constraint of passing through or near the input data points; the smoothness parameter (also called the tension parameter in some implementations) controls the tradeoff between fitting data exactly (high tension) and producing the smoothest possible surface (low tension), with high-tension minimum curvature producing surfaces that more closely honor isolated high or low values at the expense of creating local bull's-eyes, and low-tension surfaces that are smoother but may underrepresent sharp features like faults or salt contacts; minimum curvature has no statistical basis (it does not characterize spatial uncertainty) and treats all input data as equally reliable, which limits its use for quantitative uncertainty analysis.
- Kriging is the statistically optimal linear interpolation method (minimum variance estimation) that uses the variogram (a spatial statistical model describing how the variance of the property changes with distance and direction between sample pairs) to determine the optimal weights for combining nearby data points into an interpolated estimate at each grid node; kriging has two major advantages over deterministic algorithms: it provides an estimate of the interpolation uncertainty at each grid node (the kriging variance, which is large in areas far from data and small near data points), and it incorporates directional anisotropy from the variogram (so that interpolation in the direction of geological continuity uses longer-range samples than interpolation across the grain of the stratigraphy); ordinary kriging, which is the most common form, assumes a locally stationary mean and produces smooth maps that honor the variogram model; sequential Gaussian simulation (a stochastic extension of kriging) generates multiple equally probable realizations of the spatial distribution, enabling probabilistic reserve estimation and flow simulation uncertainty analysis; the variogram must be fitted to the data before kriging, and variogram model choices (nugget, range, sill, anisotropy ratio) significantly affect the kriging output, requiring geostatistical expertise to produce defensible results.
- Inverse distance weighting (IDW) is a simple, intuitive interpolation algorithm that assigns each grid node the weighted average of all input data points, where the weight of each data point is proportional to the inverse of its distance (or distance raised to a power p) from the grid node; IDW is easy to implement and computationally fast, but it has significant deficiencies for petroleum mapping: it produces bull's-eye patterns around isolated data points (all isolines become concentric circles around wells in areas without other data), it does not extrapolate beyond the range of input data values (it cannot produce interpolated values higher than the maximum or lower than the minimum of the input data), it requires selection of the power parameter p (higher p gives more weight to nearby data and sharper local features; lower p produces smoother, more global averages), and it has no statistical basis so no uncertainty quantification is possible; IDW is occasionally used for rapid reconnaissance mapping and for cases where data are so sparse that variogram fitting is not feasible, but it has been largely replaced by minimum curvature and kriging in professional practice.
- Fault handling in gridding algorithms is one of the most technically challenging aspects of structural mapping because faults are discontinuities in the geological surface that violate the smoothness assumptions built into most interpolation algorithms: a standard minimum curvature or kriging algorithm applied to a faulted surface would interpolate across the fault plane, artificially smoothing the displacement and producing an incorrect representation of the fault geometry and the footwall-hangingwall offset; fault-respecting gridding algorithms work by either explicitly honoring fault polygons as internal boundary conditions that prevent interpolation across the fault (the grid is broken into fault-bounded domains with separate interpolation in each domain), or by incorporating fault proximity into the variogram or distance calculation (reducing the effective correlation range across faults); commercial mapping packages (Petrel, Kingdom, GeoFrame, Paradigm) implement fault-respecting gridding via their structural modeling workflows, but the quality of the fault-respecting output is sensitive to the accuracy of the interpreted fault sticks, fault polygons, and horizon picks on both the footwall and hangingwall.
- Grid resolution (cell size) in petroleum mapping involves a fundamental tradeoff between spatial detail and computational cost: fine grids (small cell size, many nodes) capture short-wavelength geological features such as channel edges, fault throws, and thin reservoir pinch-outs more accurately, but require more memory and computation for both the gridding step and any subsequent simulation or mapping operations; coarse grids lose spatial detail but are faster to generate and manipulate; the optimal grid resolution is the finest grid that can be supported by the density of input data without excessive extrapolation between data points (a rule of thumb is that the grid cell size should be no smaller than one-quarter to one-half of the typical well spacing so that each grid cell contains at most one or two wells), and the finest grid that can be processed in acceptable time for the intended application (static model grids used as input to flow simulation are typically upscaled to coarser simulation grids to reduce the number of cells from millions to hundreds of thousands); grid orientation is also a consideration for anisotropic geological settings -- aligning the grid axes with the principal directions of geological continuity (along strike and dip for layered reservoirs, along the channel axis for fluvial systems) reduces interpolation artifacts compared to a north-south/east-west grid that cuts across the geological grain.
Fast Facts
The mathematical foundations of gridding algorithms used in petroleum geoscience were largely developed outside the oil industry: minimum curvature spline interpolation was established in numerical analysis in the 1960s (Briggs, 1974, adapted it for geophysical mapping), kriging was developed by the South African mining engineer Danie Krige (1951) for gold ore grade estimation and formalized mathematically by Georges Matheron at the Ecole des Mines de Paris in the 1960s as the theory of regionalized variables, and triangulation-based interpolation derives from classical computational geometry going back to Delaunay (1934). The application of these methods to petroleum reservoir mapping was driven by the development of commercial mapping software in the 1980s and 1990s (Landmark's STRATWORKS, Schlumberger's GeoFrame, IHS's Kingdom) that packaged the algorithms with interactive geological interpretation workflows. Today, machine learning approaches including neural network interpolation and Gaussian process regression (which generalizes kriging with non-stationary mean functions and non-parametric variogram models) are being evaluated for petroleum mapping applications, particularly for complex geological settings where classical variogram models are inadequate.
What Is a Gridding Algorithm?
A gridding algorithm is a computational method for interpolating or extrapolating a spatially continuous surface or volume from scattered point data (well picks, seismic interpretations, core measurements) onto a regular grid of nodes. The algorithm choice determines how values are estimated between data points, how smoothly the surface varies, whether directional trends are honored, and whether uncertainty can be quantified. Common algorithms include minimum curvature (smoothest surface), kriging (statistically optimal with uncertainty estimates), inverse distance weighting (distance-based averaging), and triangulation (surface directly from data triangles). Each has characteristic behaviors that make it more or less suitable for different geological and data conditions.
Synonyms and Related Terminology
Gridding algorithm is also called spatial interpolation, surface gridding, or contouring algorithm (when the output is contoured for map display). Related terms include kriging (a geostatistical interpolation method that uses the variogram to compute the optimal weighted linear combination of nearby data values; ordinary kriging minimizes the estimation variance subject to the unbiasedness constraint, producing interpolated maps with associated uncertainty estimates; the variogram must be fitted to the input data before kriging can be applied), variogram (a spatial statistical tool describing how the variance between pairs of data values changes with the distance and direction separating them; the variogram is the fundamental input to kriging, characterizing the range of spatial correlation, the directional anisotropy of the geological property, and the nugget variance at zero separation that reflects measurement error and small-scale variability), minimum curvature (an interpolation algorithm that finds the surface with the lowest total curvature consistent with the input data; widely used for structural and isopach mapping because it produces smooth, geologically realistic surfaces; the smoothness parameter controls the tension between fitting data exactly and minimizing curvature oscillations), sequential Gaussian simulation (a stochastic gridding method that generates multiple equally probable spatial realizations of a property by sequentially simulating values at grid nodes using the variogram-based conditional distribution; used in reservoir modeling to quantify spatial uncertainty for probabilistic reserve estimation and flow simulation), and upscaling (the process of averaging fine-scale grid property values into coarser simulation grid cells for flow simulation; gridding algorithms create the fine-scale property model, and upscaling transfers it to the coarser simulation model, typically using arithmetic averaging for horizontal permeability, harmonic averaging for vertical permeability, and arithmetic averaging for porosity).