Document Open Access Logo

Scalable Algorithmic Methods for Simulating Heavy-Rain Events (Media Exposition)

Authors Sándor P. Fekete , Phillip Keldenich , Michael Perk , Tobias Wallner

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2026.103.pdf
  • Filesize: 7.79 MB
  • 6 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
  • General and reference → Experimentation
Keywords
  • Heavy-rain events
  • hydrodynamic flows
  • scalable simulation
  • applied computational geometry
  • sensitivity analysis

Metrics

Abstract

We motivate and demonstrate simulation and evaluation of large-scale, fine-grained hydrodynamic flows, triggered by heavy-rain events. We show significant progress for simulating time-dependent, high-resolution runoff in large-scale heavy-rain scenarios, based on different geometry-based algorithmic speedup techniques. This enables us to address a second challenge: How can we deal with the instability of precipitation events, which are notoriously difficult to predict with good accuracy?

Cite As Get BibTex

Sándor P. Fekete, Phillip Keldenich, Michael Perk, and Tobias Wallner. Scalable Algorithmic Methods for Simulating Heavy-Rain Events (Media Exposition). In 42nd International Symposium on Computational Geometry (SoCG 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 367, pp. 103:1-103:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.SoCG.2026.103

Author Details

Sándor P. Fekete
  • Department of Computer Science, TU Braunschweig, Germany
  • L3S Research Center, Hannover, Germany
Phillip Keldenich
  • Department of Computer Science, TU Braunschweig, Germany
Michael Perk
  • Department of Computer Science, TU Braunschweig, Germany
Tobias Wallner
  • Department of Computer Science, TU Braunschweig, Germany

Funding

The work described here was part of project EXDIMUM, supported by the German Federal Minstery of Research, Technology and Space, grant number 02WEE1631A.

Acknowledgements

We thank our cooperation partners at SCALGO, in particular, Morten Revsbæk, Thomas Mølhave and Matthias Rav. In memoriam Lars Arge.

References

  1. Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, and Bardia Sadri. I/O-efficient efficient algorithms for computing contours on a terrain. In Symposium on Computational Geometry (SoCG), pages 129-138, 2008. URL: https://doi.org/10.1145/1377676.1377698.
  2. Pankaj K. Agarwal, Lars Arge, and Ke Yi. I/O-efficient batched union-find and its applications to terrain analysis. In Symposium on Computational Geometry (SoCG), pages 167-176, 2006. URL: https://doi.org/10.1145/1137856.1137884.
  3. Pankaj K. Agarwal, Lars Arge, and Ke Yi. I/O-efficient batched union-find and its applications to terrain analysis. ACM Transactions on Algorithms, 7(1):11:1-11:21, 2010. URL: https://doi.org/10.1145/1868237.1868249.
  4. Lars Arge, Aaron Lowe, Svend C. Svendsen, and Pankaj K. Agarwal. 1D and 2D flow routing on a terrain. ACM Transactions on Spatial Algorithms and Systems, 9(1):3:1-3:39, 2023. URL: https://doi.org/10.1145/3539660.
  5. Lars Arge and Morten Revsbæk. I/o-efficient contour tree simplification. In International Symposium on Algorithms and Computation (ISAAC), pages 1155-1165, 2009. URL: https://doi.org/10.1007/978-3-642-10631-6_116.
  6. Lars Arge, Morten Revsbaek, and Norbert Zeh. I/O-efficient computation of water flow across a terrain. In Symposium on Computational Geometry (SoCG), pages 403-412, 2010. URL: https://doi.org/10.1145/1810959.1811026.
  7. Lars Arge and Norbert Zeh. I/O-efficient strong connectivity and depth-first search for directed planar graphs. In IEEE Symposium on Foundations of Computer Science (FOCS), page 261, 2003. URL: https://doi.org/10.1109/SFCS.2003.1238200.
  8. Kate Bradbrook, Simon Waller, and Dave Morris. National floodplain mapping: datasets and methods-160,000 km in 12 months. Natural hazards, 36:103-123, 2005. URL: https://doi.org/10.1007/s11069-004-4544-9.
  9. Copernicus Digital Elevation Model (DEM). Global 30 m, version 1.1. https://registry.opendata.aws/copernicus-dem/, 2021. European Space Agency & European Commission (accessed 2025-06-23).
  10. Detlef Deumlich and Andreas Gericke. Frequency trend analysis of heavy rainfall days for germany. Water, 12(7):1950, 2020. URL: https://doi.org/10.3390/w12071950.
  11. RJ Hardy, PD Bates, and MG Anderson. The importance of spatial resolution in hydraulic models for floodplain environments. Journal of Hydrology, 216(1-2):124-136, 1999. URL: https://doi.org/10.1016/S0022-1694(99)00002-5.
  12. Neil M Hunter, PD Bates, S Neelz, G Pender, I Villanueva, NG Wright, D Liang, Roger Alexander Falconer, B Lin, S Waller, et al. Benchmarking 2d hydraulic models for urban flooding. In Proceedings of the institution of civil engineers-water management, volume 161, pages 13-30, 2008. URL: https://doi.org/10.1680/wama.2008.161.1.13.
  13. Shubham M Jibhakate, PV Timbadiya, and PL Patel. Flood hazard assessment for the coastal urban floodplain using 1d/2d coupled hydrodynamic model. Natural Hazards, 116(2):1557-1590, 2023. URL: https://doi.org/10.1007/s11069-022-05728-7.
  14. Thomas Mølhave, Pankaj K. Agarwal, Lars Arge, and Morten Revsbæk. Scalable algorithms for large high-resolution terrain data. In International Conference and Exhibition on Computing for Geospatial Research & Application (COM.Geo), pages 20:1-20:21, 2010. URL: https://doi.org/10.1145/1823854.1823878.
  15. Michael Perk, Phillip Keldenich, Tobias Wallner, and Sándor P Fekete. Hydrodynamic flows during heavy rain events: Scalable algorithmic methods for simulation and sensitivity analysis. EGUsphere, pages 1-33, 2026. Google Scholar
  16. TUFLOW. Tuflow user manual, 2025. URL: https://docs.tuflow.com/.
  17. United Nations Office for Disaster Risk Reduction. Global assessment report on disaster risk reduction 2025: Resilience Pays: Financing and Investing for our Future. UN, 2025. URL: https://www.undrr.org/gar/gar2025.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact