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.
Author supplied keywords
Cite
CITATION STYLE
Meyer, F. (2015). The waterfall hierarchy on weighted graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9082, 325–336. https://doi.org/10.1007/978-3-319-18720-4_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
