Search by property

From CSDMS

This page provides a simple browsing interface for finding entities described by a property and a named value. Other available search interfaces include the page property search, and the ask query builder.

Search by property

A list of all pages that have property "CSDMS meeting abstract" with value "Depressions—inwardly-draining regions—are common to many landscapes. When there is sufficient water availability, depressions take the form of lakes and wetlands; otherwise, they may be dry. Depressions can be hard to model, so hydrological flow models often eliminate them through filling or breaching, producing unrealistic results. However, models that retain depressions are often undesirably expensive to run. Our Depression Hierarchy poster shows how we began to address this by developing a data structure to capture the full topographic complexity of depressions in a region. Here, we present a Fill-Spill-Merge algorithm that utilizes depression hierarchies to rapidly process and distribute runoff. Runoff fills depressions, which then overflow and spill into their neighbors. If both a depression and its neighbor fill, they merge. In case studies, the algorithm runs 90–2,600× faster (with a 2,000–63,000× reduction in compute time) than commonly-used iterative methods and produces a more accurate output. Complete, well-commented, open-source code with 97% test coverage is available on Github and Zenodo.". Since there have been only a few results, also nearby values are displayed.

Showing below up to 2 results starting with #1.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)


    

List of results

    • 2022 CSDMS meeting-067  + (Depressions—inwardly-draining regions—are Depressions—inwardly-draining regions—are common to many landscapes. When there is sufficient water availability, depressions take the form of lakes and wetlands; otherwise, they may be dry. Depressions can be hard to model, so hydrological flow models often eliminate them through filling or breaching, producing unrealistic results. However, models that retain depressions are often undesirably expensive to run. Our Depression Hierarchy poster shows how we began to address this by developing a data structure to capture the full topographic complexity of depressions in a region. Here, we present a Fill-Spill-Merge algorithm that utilizes depression hierarchies to rapidly process and distribute runoff. Runoff fills depressions, which then overflow and spill into their neighbors. If both a depression and its neighbor fill, they merge. In case studies, the algorithm runs 90–2,600× faster (with a 2,000–63,000× reduction in compute time) than commonly-used iterative methods and produces a more accurate output. Complete, well-commented, open-source code with 97% test coverage is available on Github and Zenodo.overage is available on Github and Zenodo.)