1D and 2D Flow Routing on a Terrain
Aaron Lowe (1), Svend C. Svendsen (2), Pankaj K. Agarwal (1), Lars, Arge (2) ((1) Duke University, (2) Aarhus University)

TL;DR
This paper develops efficient algorithms for modeling and querying water flow across terrains represented as triangulated surfaces, addressing both internal-memory and I/O-efficient scenarios with applications to flood modeling.
Contribution
It introduces new algorithms for flow-query problems on terrains, including data structures for flow-rate functions and channel computation using Manning's equation.
Findings
Linear-size data structures for flow-rate queries
I/O-efficient algorithms for flow computation
Efficient channel computation using Manning's equation
Abstract
An important problem in terrain analysis is modeling how water flows across a terrain creating floods by forming channels and filling depressions. In this paper we study a number of \emph{flow-query} related problems: Given a terrain , represented as a triangulated -monotone surface with vertices, a rain distribution which may vary over time, determine how much water is flowing over a given edge as a function of time. We develop internal-memory as well as I/O-efficient algorithms for flow queries. This paper contains four main results: (i) We present an internal-memory algorithm that preprocesses into a linear-size data structure that for a (possibly time varying) rain distribution can return the flow-rate functions of all edges of in time, where is the number of sinks in , is the number of times…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
