arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1511.04463cs.DS
收藏

Priority-Flood:一种数字高程模型的最优凹陷填充和分水岭标注算法

Priority-Flood: An Optimal Depression-Filling and Watershed-Labeling Algorithm for Digital Elevation Models

Richard Barnes, Clarence Lehman, David Mulla

摘要:

洼地(或坑)是数字高程模型中的低区域,被较高的地形包围,没有通往低区域的出口。填充它们使它们水平,因为如果地形是不可渗透的,流体将填充它们,这在预处理DEM时通常是必要的。这里提出的抑郁填充算法--称为Priority-Flood--统一并改进了许多以前发表过类似算法的作者的工作。该算法通过使用优先级队列从DEM的边缘向内泛洪来确定要泛洪的下一个单元。生成的DEM没有凹陷或数字堤坝:每个单元都保证排水。该算法对整数和浮点数据都是最优的,分别在O(n)和O(nlgn)时间内工作。它表明,通过使用一个普通的队列,以填补凹陷,一旦他们被发现,可以实现O(m lg m)的时间复杂度,其中m不超过细胞的数量n。这是任何已知的浮点凹陷填充算法中最低的时间复杂度。在测试中,这种改进的算法比原来的算法快了37%。此外,一个旧的,但广泛使用的凹陷填充算法的并行版本需要六个并行处理器来实现与新算法的改进变体在单个处理器上的运行时间相当的运行时间。Priority-Flood算法易于理解和实现:包含的伪代码只有20行,包含的C++参考实现不到100行。该算法可以处理不规则网格以及4-、6-、8-和n-连通网格。它也可以适用于标记流域,并通过增量高程变化或凹陷雕刻来确定流向。在增量高程变化的情况下,该算法包括先前工作中不存在的安全检查。

英文摘要:

Depressions (or pits) are low areas within a digital elevation model that are surrounded by higher terrain, with no outlet to lower areas. Filling them so they are level, as fluid would fill them if the terrain were impermeable, is often necessary in preprocessing DEMs. The depression-filling algorithm presented here---called Priority-Flood---unifies and improves on the work of a number of previous authors who have published similar algorithms. The algorithm operates by flooding DEMs inwards from their edges using a priority queue to determine the next cell to be flooded. The resultant DEM has no depressions or digital dams: every cell is guaranteed to drain. The algorithm is optimal for both integer and floating-point data, working in O(n) and O(n lg n) time, respectively. It is shown that by using a plain queue to fill depressions once they have been found, an O(m lg m) time-complexity can be achieved, where m does not exceed the number of cells n. This is the lowest time complexity of any known floating-point depression-filling algorithm. In testing, this improved variation of the algorithm performed up to 37% faster than the original. Additionally, a parallel version of an older, but widely-used depression-filling algorithm required six parallel processors to achieve a run-time on par with what the newer algorithm's improved variation took on a single processor. The Priority-Flood Algorithm is simple to understand and implement: the included pseudocode is only 20 lines and the included C++ reference implementation is under a hundred lines. The algorithm can work on irregular meshes as well as 4-, 6-, 8-, and n-connected grids. It can also be adapted to label watersheds and determine flow directions through either incremental elevation changes or depression carving. In the case of incremental elevation changes, the algorithm includes safety checks not present in prior works.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑