Skip to Main content Skip to Navigation
Conference papers

The waterfall hierarchy on weighted graphs

Fernand Meyer 1, * 
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. It It makes use of the equivalence of node and edge weighted graphs, passing from one type to the other during as the algorithm proceeds. 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
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Fernand Meyer Connect in order to contact the contributor
Submitted on : Friday, January 30, 2015 - 8:45:16 PM
Last modification on : Wednesday, November 17, 2021 - 12:27:12 PM
Long-term archiving on: : Saturday, September 12, 2015 - 7:16:09 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Fernand Meyer. The waterfall hierarchy on weighted graphs. International Symposium on Mathematical Morphology and Its Applications to Signal and Image Processing, 2015, Reykjavik, Iceland. ⟨10.1007/978-3-319-18720-4_28⟩. ⟨hal-01111747⟩



Record views


Files downloads