Application of Fibonacci heap to fast marching method

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 efficienc...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Meng Fanchang, Liu Mingchen, Zhang Ping, Yang Junjie, Li Meng, Dong Jiguo
Formato:	article
Lenguaje:	EN
Publicado:	De Gruyter 2021
Materias:	fast marching method fibonacci heap sort travel time calculation seismic wave propagation eikonal equation Physics QC1-999
Acceso en línea:	https://doaj.org/article/35aa242c7c2b4bc5be17247edde6943e
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:35aa242c7c2b4bc5be17247edde6943e
record_format	dspace
spelling	oai:doaj.org-article:35aa242c7c2b4bc5be17247edde6943e2021-12-05T14:11:01ZApplication of Fibonacci heap to fast marching method2391-547110.1515/phys-2021-0030https://doaj.org/article/35aa242c7c2b4bc5be17247edde6943e2021-05-01T00:00:00Zhttps://doi.org/10.1515/phys-2021-0030https://doaj.org/toc/2391-5471The 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.Meng FanchangLiu MingchenZhang PingYang JunjieLi MengDong JiguoDe Gruyterarticlefast marching methodfibonacci heap sorttravel time calculationseismic wave propagationeikonal equationPhysicsQC1-999ENOpen Physics, Vol 19, Iss 1, Pp 281-284 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	fast marching method fibonacci heap sort travel time calculation seismic wave propagation eikonal equation Physics QC1-999
spellingShingle	fast marching method fibonacci heap sort travel time calculation seismic wave propagation eikonal equation Physics QC1-999 Meng Fanchang Liu Mingchen Zhang Ping Yang Junjie Li Meng Dong Jiguo Application of Fibonacci heap to fast marching method
description	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.
format	article
author	Meng Fanchang Liu Mingchen Zhang Ping Yang Junjie Li Meng Dong Jiguo
author_facet	Meng Fanchang Liu Mingchen Zhang Ping Yang Junjie Li Meng Dong Jiguo
author_sort	Meng Fanchang
title	Application of Fibonacci heap to fast marching method
title_short	Application of Fibonacci heap to fast marching method
title_full	Application of Fibonacci heap to fast marching method
title_fullStr	Application of Fibonacci heap to fast marching method
title_full_unstemmed	Application of Fibonacci heap to fast marching method
title_sort	application of fibonacci heap to fast marching method
publisher	De Gruyter
publishDate	2021
url	https://doaj.org/article/35aa242c7c2b4bc5be17247edde6943e
work_keys_str_mv	AT mengfanchang applicationoffibonacciheaptofastmarchingmethod AT liumingchen applicationoffibonacciheaptofastmarchingmethod AT zhangping applicationoffibonacciheaptofastmarchingmethod AT yangjunjie applicationoffibonacciheaptofastmarchingmethod AT limeng applicationoffibonacciheaptofastmarchingmethod AT dongjiguo applicationoffibonacciheaptofastmarchingmethod
_version_	1718371468781289472

Application of Fibonacci heap to fast marching method

Ejemplares similares