New efficient methods to calculate watersheds
arXiv:0909.2780 · doi:10.1088/1742-5468/2009/09/P09007
Abstract
We present an advanced algorithm for the determination of watershed lines on Digital Elevation Models (DEMs), which is based on the iterative application of Invasion Percolation (IIP). The main advantage of our method over previosly proposed ones is that it has a sub-linear time-complexity. This enables us to process systems comprised of up to 10^8 sites in a few cpu seconds. Using our algorithm we are able to demonstrate, convincingly and with high accuracy, the fractal character of watershed lines. We find the fractal dimension of watersheds to be Df = 1.211 +/- 0.001 for artificial landscapes, Df = 1.10 +/- 0.01 for the Alpes and Df = 1.11 +/- 0.01 for the Himalaya.
12 pages, 5 figures, uses iopam.sty and setstack.sty, is published at IOP
References in corpus (2)
Cited by in corpus (18)
- Explosive percolation via control of the largest cluster
- Recent advances and open challenges in percolation
- Fracturing highly disordered materials
- Percolation with long-range correlated disorder
- Watersheds are Schramm-Loewner Evolution curves
- Fracturing ranked surfaces
- Gaussian model of explosive percolation in three and higher dimensions
- Bohman-Frieze-Wormald model on the lattice, yielding a discontinuous percolation transition
- Optimal path cracks in correlated and uncorrelated lattices
- Impact of Perturbations on Watersheds
- Scaling Relations for Watersheds
- A universal approach for drainage basins
- Corrections to Scaling for Watersheds, Optimal Path Cracks, and Bridge Lines
- Stacked triangular lattice: Percolation properties
- Critical phenomena of a hybrid phase transition in cluster merging dynamics
- Exact evaluation of the cutting path length in a percolation model on a hierarchical network
- Loop erased random walk on percolation cluster: Crossover from Euclidean to fractal geometry
- Fractality of eroded coastlines of correlated landscapes