一种近线性时间计算山地突起度的高效算法
An Efficient Algorithm for Computing Mountain Prominence in Almost Linear Time
浏览论文内容
中文总结 AI 辅助
该研究针对山地突起度计算需求，基于经典算法提出近线性时间高效算法，用SRTM数据集3弧秒数据验证，适配减少信息存储仍保正确性，应对数据量增长挑战。
中文摘要 AI 辅助
突起度是地形学和登山运动中最重要的测量指标之一。本文描述了一种高效的近线性时间算法，用于利用数字高程模型（DEMs）计算地球上所有山峰的山地突起度。该算法基于经典算法构建，利用了只有少数山峰的突起度由相对较远的其他山峰决定这一观察结果，因此经典算法可适配为在不损失正确性的情况下存储和使用更少信息。该算法使用来自SRTM数据集的3弧秒真实数据进行验证，其重要性因地球测绘方法精度的不断提高以及计算突起度所需处理的数据量相应增长而凸显。
英文摘要
Prominence is one of the most important measurements in topography and mountaineering. This paper describes an efficient, almost linear time algorithm for computing mountain prominence for all peaks on Earth using digital elevation models (DEMs). It builds on top of a classic algorithm and leverages the observation that only a few peaks have their prominence determined by a relatively distant other mountain. Thus, the classic algorithm can be adapted to memorize and use less information without the loss of correctness. The algorithm is demonstrated using 3 arcsecond real-life data from SRTM datasets. Its importance is underscored by the increasing accuracy of Earth mapping methods and the corresponding growth in the amount of data that must be processed to compute prominence.
