The Complexity of Rivers in Triangulated Terrains
Proceedings of the 8th Canadian Conference on Computational Geometry
Molecular shape analysis based upon the morse-smale complex and the connolly function
Proceedings of the nineteenth annual symposium on Computational geometry
Morse-Smale decompositions for modeling terrain knowledge
COSIT'05 Proceedings of the 2005 international conference on Spatial Information Theory
I/O-Efficient flow modeling on fat terrains
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Flow computations on imprecise terrains
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Exact and approximate computations of watersheds on triangulated terrains
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Flow on noisy terrains: an experimental evaluation
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
Flow-related structures on terrains are defined in terms of paths of steepest descent (or ascent). A steepest descent path on a polyhedral terrain T with n vertices can have θ(n2) complexity. The watershed of a point p---the set of points on T whose paths of steepest descent reach p---can have complexity θ(n3). We present a technique for tracing a collection of n paths of steepest descent on T implicitly in O(n log n) time. We then derive O(n log n) time algorithms for: (i) computing for each local minimum p of T the triangles contained in the watershed of p and (ii) computing the surface network graph of T. We also present an O(n2) time algorithm that computes the watershed area for each local minimum of T.