pith. sign in

arxiv: 0909.2780 · v1 · submitted 2009-09-15 · ❄️ cond-mat.dis-nn

New efficient methods to calculate watersheds

E. Fehr , J. S. Andrade Jr. , S. D. da Cunha , L. R. da Silva , H. J. Herrmann , D. Kadau , C. F. Moukarzel , E. A. Oliveira This is my paper
classification ❄️ cond-mat.dis-nn
keywords algorithmfractallineswatershedwatershedsableaccuracyadvanced
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.