The fast marching method (FMM) is an efficient, stable and adaptable travel time calculation method. In the realization of this method, it is necessary to select the minimum travel time node from the narrow band many times. The selection method has an important influence on the calculation efficiency of FMM. Traditional FMM adopts the binary tree heap sorting method to achieve this step. Fibonacci heap sort method to FMM will be applied in this study. Compared with the binary tree heap sorting method, the Fibonacci heap sort method can realize the minimum travel time node selection in the narrow band in a more efficient way when the number of the narrow-band nodes is huge. The new method will be verified through error analysis and two numerical model calculations.

中文翻译：

---

斐波那契堆在快速行进法中的应用

快速行进方法（FMM）是一种高效，稳定和适应性强的行驶时间计算方法。在该方法的实现中，需要多次从窄带中选取最小旅行时间节点。选择方法对 FMM 的计算效率有重要影响。传统的FMM采用二叉树堆排序的方法来实现这一步。FMM 的斐波那契堆排序方法将在本研究中应用。与二叉树堆排序方法相比，斐波那契堆排序方法可以在窄带节点数量巨大的情况下，以更高效的方式实现窄带内最小旅行时间节点的选择。新方法将通过误差分析和两次数值模型计算进行验证。