|
159
|
External-Memory Graph Algorithms
– Yi-Jen Chiang , Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter
- 1995
|
|
494
|
The input/output complexity of sorting and related problems. Commun
– A AGGARWAL, J S VITTER
- 1988
|
|
46
|
The buffer tree: A technique for designing batched external data structures
– L Arge
|
|
13
|
Flow Computation on Massive Grid Terrains
– Lars Arge, Jeffrey S. Chase, Patrick Halpin, Laura Toma, Jeffrey S. Vitter, Dean Urban, Rajiv Wickremesinghe
- 2001
|
|
175
|
Topological Persistence and Simplification
– Herbert Edelsbrunner, David Letscher, Afra Zomorodian
- 2000
|
|
81
|
Extracting topographic structure from digital elevation data for geographic information system analysis. Photogrammetric Engineering and Remote
– S. K. Jenson, J. O. Domingue
- 1988
|
|
6
|
TerraStream: From elevation data to watershed hierarchies
– Andrew Danner, Pankaj K. Agarwal, Ke Yi, Lars Arge
|
|
17
|
Artifacts of TIN-based surface flow modeling
– D Theobald, M Goodchild
- 1990
|
|
13
|
I/O-efficient algorithms for contour line extraction and planar graph blocking
– P K Agarwal, L Arge, T M Murali, K Varadarajan, J S Vitter
- 1998
|
|
78
|
External Memory Data Structures
– Lars Arge
- 2001
|
|
286
|
External Memory Algorithms and Data Structures
– Jeffrey Scott Vitter
- 1998
|
|
66
|
The extraction of drainage networks from digital elevation data
– J F O’Callaghan, D M Mark
- 1984
|
|
39
|
Hierarchical Morse Complexes for Piecewise Linear 2-Manifolds
– Herbert Edelsbrunner, John Harer, Afra Zomorodian
- 2001
|
|
9
|
An outlet breaching algorithm for the treatment of closed depressions in a raster DEM
– L W Martz, J Garbrecht
- 1999
|
|
8
|
Carving and adaptive drainage enforcement of grid digital elevation models
– Pierre Soille, Jürgen Vogt, Roberto Colombo
|
|
99
|
Computing Contour Trees in All Dimensions
– Hamish Carr, Jack Snoeyink, Ulrike Axen
- 1999
|
|
7
|
Flooding triangulated terrain
– Y Liu, J Snoeyink
- 2004
|
|
13
|
I/O-efficient point location using persistent B-trees
– Lars Arge, Andrew Danner, Sha-mayn Teh
- 2003
|
|
29
|
I/O-Efficient Dynamic Planar Point Location
– Lars Arge, Jan Vahrenhold
|
