A scalable parallel minimum spanning tree algorithm for catchment basin delimitation in large digital elevation models

Concurrency and Computation: Practice and Experience

Volumn 25, Issue 10, 2013, Pages 1394-1409

  Do, Hiep Thuan ^a   Limet, Sébastien ^a   Melin, Emmanuel ^a  

^a UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

catchment basin; digital elevation model; geographic information system; image segmentation; minimum spanning tree

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATION THEORY; DIGITAL INSTRUMENTS; FORESTRY; GEOGRAPHIC INFORMATION SYSTEMS; GEOMORPHOLOGY; GRAPH ALGORITHMS; GROUNDWATER; HYDROGEOLOGY; IMAGE SEGMENTATION; RUNOFF; TREES (MATHEMATICS);

CATCHMENT BASINS; DIGITAL ELEVATION MODEL; MINIMAL SPANNING TREE; MINIMUM SPANNING TREES; PC CLUSTERS;

SURVEYING;

ALGORITHMS; GEOLOGY; GIS; HYDROLOGY; IMAGE ANALYSIS; MATHEMATICAL MODELS; RIVERS; RUNOFF;

EID: 84879410898     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.2950     Document Type: Article

References (29)

1. Hutchinson MF,. A new procedure for gridding elevation and stream line data with automatic removal of spurious pits. Journal of Hydrology 1989; 106 (3-4): 211-232. (Pubitemid 19305600)
2. Arge L, Chase JS, Halpin P, Toma L, Vitter JS, Urban D, Wickremesinghe R,. Flow computation on massive grid terrains. GeoInformatica 2001; 7: 2003.
3. Jenson S, Domingue J,. Extracting topographic structure from digital elevation data for geographic information system analysis. Photogrammetric Engineering and Remote Sensing 1988; 54 (11): 1593-1600.
4. Peckham SD,. River network extraction from large DEMs. Ph.D. Thesis, U. of Colorado, 1995.
5. Tarboton DG,. A new method for the determination of flow directions and upslope areas in grid elevation models. Water Resources Research 1997; 32: 309-319.
6. O'callaghan JF, Mark DM,. The extraction of drainage networks from digital elevation data. Computer Vision, Graphics and Image Processing 1984; 28: 328-344.
7. Quinn P, Beven K, Chevallier P, Planchon O,. The prediction of hillslope flow paths for distributed hydrological modelling using digital terrain models. Hydrological Processes 1991; 5: 9-79.
8. Qin C, Zhu A-X, Pei T, Li B, Zhou C, Yang L,. An adaptative approach to selecting flow partition exponent for multiple flow direction algorithm. International Journal of Geographical Information Science 2007; 21: 443-458. (Pubitemid 46510964)
9. Garbrecht J, Martz LW,. The assignment of drainage direction over flat surfaces in raster digital elevation models. Journal of Hydrology 1997; 193: 204-213. (Pubitemid 27275277)
10. Tribe A,. Automated recognition of valley lines and drainage networks from grid digital elevation models: a review and a new method. Journal of Hydrology 1992; 139: 263-293.
11. Roerdink JBTM, Meijster A,. The watershed transform: definitions, algorithms and parallelization strategies. Fundamenta Informaticae 2001; 41 (6): 187-228.
12. Callow JN, Van Niel KP, Boggs GS,. How does modifying a DEM to reflect known hydrology affect subsequent terrain analysis? Journal of Hydrology 2007; 332 (1-2): 30-39. (Pubitemid 44937311)
13. Beucher S, Meyer F,. The morphological approach to segmentation: the watershed transformation. In Mathematical Morphology in Image Processing, Vol. 34 of Optical Engineering, chapter 12, Dougherty ER, (ed.). Marcel Dekker: New York, 1993.
14. Vincent L, Soille P,. Watersheds in digital spaces: an efficient algorithm based on immersion simulations. IEEE Transactions on Pattern Analysis and Machine Intelligence 1991; 13 (6): 583-598. (Pubitemid 21675616)
15. Stoev SL,. RaFSi-a fast watershed algorithm based on rainfalling simulation. In Proceedings of 8-th International Conference on Computer Graphics, Visualization, and Interactive Digital Media (WSCG'2000), Plzen-Bory, Czech Republic, 2000; 100-107.
16. Sun H, Yang J, Ren M,. A fast watershed algorithm based on chain code and its application in image segmentation. Pattern Recognition Letters 2005; 26 (9): 1266-1274. (Pubitemid 40644690)
17. Meyer F,. Hierarchies of partitions and morphological segmentation. Scale-Space '01: Proceedings of the Third International Conference on Scale-Space and Morphology in Computer Vision, Springer-Verlag, London, UK, 2001; 161-182. (Pubitemid 33303179)
18. Beucher S, Marcotegui B,. Fast implementation of waterfall based on graphs. Computational Imaging and Vision 2005; 30: 177-186.
19. Moga AN,. Parallel watershed algorithms for image segmentation. Ph.D. Thesis, Tampere University Technology, February 1997.
20. Moga AN, Gabbouj M,. A parallel marker based watershed transformation. Proceedings International Conference on Image Processing, Vol. 2, IEEE Computer Society Press, Lausanne, Switzerland, September 1996; 137-140.
21. Bieniek A, Burkhardt H, Marschner H, Nöelle M,. A parallel watershed algorithm. Proceedings of 10th Scandinavian Conference on Image Analysis, Lappeenranta, Finland, June 1997; 237-244.
22. Moga AN, Gabbouj M,. Parallel image component labeling with watershed transformation. IEEE Transactions on Pattern Analysis and Machine Intelligence 1997; 19 (5): 441-450. (Pubitemid 127762236)
23. Meijster A, Roerdink JBTM,. A disjoint set algorithm for the watershed transform. In Proceedings IX European Signal Processing Conference (EUSIPCO'98), Theodoridis S, Pitas I, Stouraitis A, Kalouptsidis N, (eds). Typorama Publications: Patras, 1998.
24. Tarjan RE,. Data Structure and Network Algorithms. Society for Industrial and Applied Mathematics, 1983. DOI: 10.1137/1.9781611970265.
25. Chazelle B,. A minimum spanning tree algorithm with inverse-Ackermann type complexity. Journal of the ACM 2000; 47 (6): 1028-1047.
26. Nesetril J, Milková E, Nesetrilová H,. Otakar Borůvka on minimum spanning tree problem translation of both the 1926 papers, comments, history. Discrete Mathematics 2001; 233 (1-3): 3-36. (Pubitemid 33660390)
27. Dehne F, Götz S,. Practical parallel algorithms for minimum spanning trees. Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems, SRDS '98, IEEE Computer Society; Washington, DC, USA, 1998; 366-371. (Available from:http://dl.acm.org/citation.cfm?id=829523.830957).
28. Chung S, Condon A,. Parallel implementation of Borůvka minimum spanning tree algorithm. IPPS '96: Proceedings of the 10th International Parallel Processing Symposium, IEEE Computer Society, Honolulu, HI, 1996; 302-308.
29. Toma L, Wickremesinghe R, Arge L, Chase JS, Vitter JS, Halpin PN, Urban D,. Flow computation on massive grids. Proceedings of the ACM Symposium on Advances in Geographic Information Systems, 2001; 82-87, DOI: 10.1145/512161.512180.