The Waterfall Hierarchy on Weighted Graphs

Abstract : We study and present two new algorithms for constructing the waterfall hierarchy of a topographic surface. The first models a topographic surface as a flooding graph, each node representing a lake filling a catchment basin up to its lowest pass point ; each edge representing such a pass point. The second algorithm produces the waterfall partition in one pass through the edges of a minimum spanning tree of the region adjacency graph associated to a topographic surface.
Document type :
Conference papers
Liste complète des métadonnées

https://hal-mines-paristech.archives-ouvertes.fr/hal-01255435
Contributor : Fernand Meyer <>
Submitted on : Wednesday, January 13, 2016 - 4:13:44 PM
Last modification on : Monday, November 12, 2018 - 11:00:02 AM

Links full text

Identifiers

Citation

Fernand Meyer. The Waterfall Hierarchy on Weighted Graphs. ISMM 2015, May 2015, Reykjavic, Iceland. ⟨10.1007/978-3-319-18720-4_28⟩. ⟨hal-01255435⟩

Share

Metrics

Record views

109