A quick algorithm of counting flow accumulation matrix for deriving drainage networks from a DEM
Computerized auto-extraction of drainage networks from Digital Elevation Model (DEM) has been widely used in hydrological modeling and relevant studies. Several essential procedures need to be implemented in eight-directional(D8) watershed delineation method, among which a problem need to be resolved is the lack of a high efficiency algorithm for quick and accurate computation of flow accumulation matrix involved in river network delineations. For the problem of depression filling, the algorithm presented by Oliver Planchon has resolved it. This study was aimed to develop a simple and quick algorithm for flow accumulation matrix computations. For this purpose, a simple and high efficiency algorithm of the time complexity of O(n) compared to the commonly used code of the time complexity of O (n2) orO(nlogn), has been developed. Performance tests on this newly developed algorithm were conducted for different size of DEMs, and the results suggested that the algorithm has a linear time complexity with increasing sizes of DEM. The computation efficiency of this newly developed algorithm is many times higher than the commonly used code, and for a DEM of size 1000*1000, flow accumulation matrix computation can be completed within only several seconds compared with about few minutes needed by common used algorithms.
drainage networks digital elevation models flow accumulation matrix hydrological models
Wang Yanping Liu Yonghe Xie Hongbo Xiang ZhongLin
The Library of Henan Polytechnic University, Jiaozuo, 454000, P.R. China Institute of Resources and Environment, Henan Polytechnic University, 454000, P.R. China Liu Yonghe, Institute of Resources and Environment, Henan Polytechnic University, 454000, P.R. China
国际会议
Third International Conference on Digital Image Processing(ICDIP 2011)(第三届数字图像处理国际会议)
成都
英文
436-439
2011-04-15（万方平台首次上网日期，不代表论文的发表时间）