The input/output complexity of sorting and related problems
Communications of the ACM
Heaps and heapsort on secondary storage
Theoretical Computer Science
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Hierarchical morse complexes for piecewise linear 2-manifolds
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Flow computation on massive grids
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Computers & Geosciences - Special issue on GeoComp 99- GeoComputation and the Geosciences
Topological persistence and simplification
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
I/O-efficient batched union-find and its applications to terrain analysis
Proceedings of the twenty-second annual symposium on Computational geometry
I/o efficient algorithms and applications in geographic information systems
I/o efficient algorithms and applications in geographic information systems
I/O-Efficient Contour Tree Simplification
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
I/O-Efficient flow modeling on fat terrains
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
Consider rain falling at a uniform rate onto a terrain T represented as a triangular irregular network. Over time, water collects in the basins of T, forming lakes that spill into adjacent basins. Our goal is to compute, for each terrain vertex, the time this vertex is flooded (covered by water). We present an I/O-efficient algorithm that solves this problem using O(sort(X) log (X/M) + sort(N)) I/Os, where N is the number of terrain vertices, X is the number of pits of the terrain, sort(N) is the cost of sorting N data items, and M is the size of the computer's main memory. Our algorithm assumes that the volumes and watersheds of the basins of T have been precomputed using existing methods.