Log In
Or create an account -> 
Imperial Library
  • Home
  • About
  • News
  • Upload
  • Forum
  • Help
  • Login/SignUp

Index
Cover Table of Contents Notations Introduction PART 1: Flooding
1 Modelling Flooding in Edge- or Node-weighted Graphs
1.1. Summary of the chapter 1.2. The importance of flooding 1.3. Description of the flood covering a topographic surface 1.4. The relations between n-floodings and e-floodings 1.5. Flooding a flowing graph
2 Lakes and Regional Minima
2.1. Summary of the chapter 2.2. Lakes from e-floodings and n-floodings 2.3. Regional minimum lakes and full lakes 2.4. Coherence between the definitions of lakes in G[ν, nil] and in G[nil, δenν]
3 Among all Possible Floodings, Choosing One
3.1. Summary of the chapter 3.2. Various mechanisms for selecting a particular flooding 3.3. The topography of dominated flooding 3.4. Computing dominated flooding by local adjustments
4 Flooding and Flooding Distances
4.1. Summary of the chapter 4.2. Flooding distances 4.3. The shortest path algorithms for computing dominated flooding 4.4. The flooding core-expanding algorithm 4.5. Marker-based segmentation
5 Graph Flooding via Dendrograms
5.1. Summary of the chapter 5.2. Introduction 5.3. Dendrograms: reminder 5.4. The hierarchy of lake zones 5.5. The law of communicating vessels 5.6. Dominated flooding on the dendrogram of lake zones 5.7. Constructing and flooding a binary dendrogram 5.8. A derived algorithm for dominated flooding
PART 2: Modeling a Real Hydrographic Basin
6 The Hydrographic Basin of a Digital Elevation Model
6.1. Summary of the chapter 6.2. Preprocessing the digital elevation model
PART 3: Watershed Partitions
7 Minimum Spanning Forests and Watershed Partitions
7.1. Summary of the chapter 7.2. Flooding distance, minimum spanning trees and forests 7.3. Minimum spanning forests rooted in markers 7.4. Watershed partitions of weighted graphs 7.5. Minimum spanning forests rooted in the regional minima 7.6. A manifold of different watershed partitions 7.7. Reducing the number of watershed partitions
8 Marker-based Segmentation
8.1. Dominated flooding and minimum spanning forests 8.2. Constructing a minimum spanning forest rooted in the markers 8.3. Marker-based segmentation after flooding the graph 8.4. Directly constructing a marker-based ∞− steep watershed partition with the core expanding algorithm 8.5. The early days of marker-based segmentation 8.6. A two scale marker-based segmentation 8.7. Instant marker-based segmentation
Conclusion Appendix: Mathematical Recap and Notations
A.1. Graphs A.2. Equivalence classes A.3. Flowing graphs A.4. Operators on node labels A.5. Steepness of flowing paths and graph prunings A.6. Floodings A.7. Hierarchies, dendrograms
References Index End User License Agreement
  • ← Prev
  • Back
  • Next →
  • ← Prev
  • Back
  • Next →

Chief Librarian: Las Zenow <zenow@riseup.net>
Fork the source code from gitlab
.

This is a mirror of the Tor onion service:
http://kx5thpx2olielkihfyo4jgjqfb7zx7wxr3sd4xzt26ochei4m6f7tayd.onion