SEARCH

SEARCH BY CITATION

We present simulations of large-scale landscape evolution on tectonic time scales obtained from a new numerical model which allows for arbitrary spatial discretization. The new method makes use of efficient algorithms from the field of computational geometry to compute the set of natural neighbours of any irregular distribution of points in a plane. The natural neighbours are used to solve geomorphic equations that include erosion/deposition by channelled flow and diffusion. The algorithm has great geometrical flexibility, which makes it possible to solve problems involving complex boundaries, radially symmetrical uplift functions and horizontal tectonic transport across strike-slip faults. The algorithm is also ideally suited for problems which require large variations in spatial discretization and/or self-adaptive meshing. We present a number of examples to illustrate the power of the new approach and its advantages over more ‘classical’ models based on regular (rectangular) discretization. We also demonstrate that the synthetic river networks and landscapes generated by the model obey the laws of network composition and have scaling properties similar to those of natural landscapes. Finally we explain how orographically controlled precipitation and flexural isostasy may be easily incorporated in the model without sacrificing efficiency.