A simple algorithm for the mapping of TIN data onto a static grid: Applied to the stratigraphic simulation of river meander deposits
- Title
- A simple algorithm for the mapping of TIN data onto a static grid: Applied to the stratigraphic simulation of river meander deposits
- Creator(s)
- Clevis, Quintijn
- Tucker, Gregory E.
- Lancaster, Stephen T.
- Desitter, Arnaud
- Gasparini, Nicole
- Lock, Gary
- Date
- 2006
- Is Part Of
- Computers & Geosciences
- Volume
- 32
- Issue
- 6
- Pages
- 749-766
- Language
- eng
- ISSN
- 0098-3004
- Short Title
- A simple algorithm for the mapping of TIN data onto a static grid
- Abstract
- Triangulated irregular networks (TIN) in landscape evolution models have the advantage of representing geologic processes that involve a horizontal component, such as faulting and river meandering, due to their adaptive remeshing capability of moving, adding and deleting nodes. However, the moving node feature is difficult to integrate with the accumulation of a three-dimensional (3D) subsurface stratigraphy, because it requires 3D subsurface interpolation, which results in stratigraphic data loss due to heterogeneity of the subsurface and averaging effects. We present a simple algorithm that maps any changes in the configuration of TIN landscape nodes onto a static grid, facilitating the creation of a fixed stratigraphic record of TIN surface change. The algorithm provides a practical solution not only for the stratigraphic problem, but also for other problems that involve linking of models that use TIN and raster discretization schemes. An example application is presented using the river meandering module incorporated in the CHILD landscape evolution model. Examples are shown of cross-sections, and voxel distributions and geo-archaeological depth–age maps. These illustrate the type of insights that can be obtained from process-based modeling of subsurface fluvial architecture, and highlight potential applications of stratigraphic simulation.
Linked resources
Export
Position: 9286 (7 views)