New parallel algorithms for flow routing on DEMs achieve 4.0 seconds runtime on a 1.88-billion-point model using 12,288 processes, extending prior sequential and moderately parallel methods.
Computer Vision, Graphics, and Image Processing 28, 323–344
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Massively parallel flow routing and drainage area determination
New parallel algorithms for flow routing on DEMs achieve 4.0 seconds runtime on a 1.88-billion-point model using 12,288 processes, extending prior sequential and moderately parallel methods.