Depression detection in billion-scale DEM grids in digital terrain analysis using HRBTree

Depression detection in digital terrain analysis is crucial for surface process modelling. High-resolution satellite imagery has led to an increasing demand for processing ultra-large-scale digital elevation models (DEMs) with billions of grid cells, which has exposed the computational inefficiencies of traditional priority-flood algorithms based on priority queues. While existing research has primarily focused on reducing the data volume in priority-flood’s priority queues, few studies have focused on optimizing the sorting mechanism within these queues. In this paper, we propose a hybrid Hash Red Black Tree (HRBTree) data structure, integrating the efficient insertion capability of hash tables with the ordered key-value maintenance of the RBTree, thereby reconstructing the priority queue architecture of the priority-flood algorithm. Using multi-scale DEM datasets ranging from millions to 1.6 billion grid cells, we systematically evaluated the computational efficiency of the enhanced priority-flood algorithm across varying data scales. The experimental results demonstrate that the proposed HRBTree structure exhibits superior adaptability, particularly in ultra-large-scale datasets (> 1 billion nodes), achieving a maximum speedup of 49% compared with traditional priority queue structures, which validates the effectiveness of heterogeneous data structure fusion. After modifying three classic priority-flood variants (Wang & Liu, Barnes, and Zhou), the HRBTree demonstrates strong generalizability. Specifically, on billion-scale datasets, the HRBTree-optimized Wang & Liu algorithm achieves a 45.6% speedup (average 35.1%), the Barnes algorithm improves by up to 37.6%, and the Zhou algorithm reaches a 28.2% speedup, confirming the structure’s compatibility with diverse algorithmic frameworks. This study provides critical insights for the engineering application of terrain analysis algorithms and lays the foundation for next-generation high-performance, scalable computing paradigms in terrain analysis systems.

Authors

Institutions

Publication Details

Journal
Earth Science Informatics
Published
2025-11-12
DOI
https://doi.org/10.1007/s12145-025-02050-1
Citations
1
Primary Topic
Automated Road and Building Extraction
Type
article
Field-Weighted Citation Impact
1.15

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Depression detection in billion-scale DEM grids in digital terrain analysis using HRBTree

Lejun Ma, Huan Wang, Yanan Liu, Yue Yuan et al.
1 citations
Earth Science Informatics
Automated Road and Building Extraction
1.15
article

Depression detection in billion-scale DEM grids in digital terrain analysis using HRBTree

Lejun Ma, Huan Wang, Yanan Liu, Yue Yuan, Wei Hu, Xingnan Zhang
article en
1 citations

Abstract

Depression detection in digital terrain analysis is crucial for surface process modelling. High-resolution satellite imagery has led to an increasing demand for processing ultra-large-scale digital elevation models (DEMs) with billions of grid cells, which has exposed the computational inefficiencies of traditional priority-flood algorithms based on priority queues. While existing research has primarily focused on reducing the data volume in priority-flood’s priority queues, few studies have focused on optimizing the sorting mechanism within these queues. In this paper, we propose a hybrid Hash Red Black Tree (HRBTree) data structure, integrating the efficient insertion capability of hash tables with the ordered key-value maintenance of the RBTree, thereby reconstructing the priority queue architecture of the priority-flood algorithm. Using multi-scale DEM datasets ranging from millions to 1.6 billion grid cells, we systematically evaluated the computational efficiency of the enhanced priority-flood algorithm across varying data scales. The experimental results demonstrate that the proposed HRBTree structure exhibits superior adaptability, particularly in ultra-large-scale datasets (> 1 billion nodes), achieving a maximum speedup of 49% compared with traditional priority queue structures, which validates the effectiveness of heterogeneous data structure fusion. After modifying three classic priority-flood variants (Wang & Liu, Barnes, and Zhou), the HRBTree demonstrates strong generalizability. Specifically, on billion-scale datasets, the HRBTree-optimized Wang & Liu algorithm achieves a 45.6% speedup (average 35.1%), the Barnes algorithm improves by up to 37.6%, and the Zhou algorithm reaches a 28.2% speedup, confirming the structure’s compatibility with diverse algorithmic frameworks. This study provides critical insights for the engineering application of terrain analysis algorithms and lays the foundation for next-generation high-performance, scalable computing paradigms in terrain analysis systems.

Earth Science InformaticsVol. 18(4)
Hohai University (CN), State Key Laboratory of Hydrology-Water Resources and Hydraulic Engineering (CN), Nanjing Hydraulic Research Institute (CN), Jinling Institute of Technology (CN)
National Natural Science Foundation of China, Ministry of Water Resources, Jinling Institute of Technology
Openalex Percentile: Top 17%
Automated Road and Building Extraction
1.15
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.