Remarks on the implementation of the fast marching method

The fast marching algorithm computes an approximate solution to the eikonal equation in time, where the factor log N is due to the administration of a priority queue. Recently, Yatziv et al. (2006 J. Comput. Phys., 212, 393–399) have suggested using an untidy priority queue, reducing the overall com...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IMA journal of numerical analysis 2009-07, Vol.29 (3), p.806-813
Hauptverfasser:	Rasch, Christian, Satzger, Thomas
Format:	Artikel
Sprache:	eng
Schlagworte:	Approximation Complexity distance function eikonal equation Errors Estimates fast marching method Mathematical models Priorities Queues Robustness untidy priority queue
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!