Computing representative networks for braided rivers
DOI10.20382/JOCG.V10I1A14zbMATH Open1432.68520OpenAlexW2994763411MaRDI QIDQ5207876FDOQ5207876
Authors: Maarten Kleinhans, Tim Ophelders, Willem Sonke, Bettina Speckmann, Kevin Verbeek, Marc Van Kreveld
Publication date: 13 January 2020
Full work available at URL: https://pure.tue.nl/ws/files/141451796/356_1920_1_PB.pdf
Recommendations
- scientific article; zbMATH DE number 6917067
- Parallel algorithms for multifractal analysis of river networks
- The use of B-splines to represent the topography of river networks
- scientific article; zbMATH DE number 775066
- SIMULATING SEDIMENT TRANSPORT ON RIVER NETWORKS
- River landscapes and optimal channel networks
- A Hierarchical Cluster System Based on Horton–Strahler Rules for River Networks
- Characterizing flows by complex network methods
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (2)
This page was built for publication: Computing representative networks for braided rivers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207876)