アイコナール方程式の高速解法に関する実験的サーベイ
Fast Methods for Eikonal Equations: an Experimental Survey
Fast Marching法をはじめとする9種類の到着時間マップ計算アルゴリズムを共通の枠組みで整理し、代表的な環境で計算時間を実験的に比較したサーベイ論文。
著者: Javier V. Gomez, David Alvarez, Santiago Garrido, Luis Moreno
分類: math.NA, cs.NA, cs.RO
原文アブストラクト
The Fast Marching Method is a very popular algorithm to compute times-of-arrival maps (distances map measured in time units). Since their proposal in 1995, it has been applied to many different applications such as robotics, medical computer vision, fluid simulation, etc. Many alternatives have been proposed with two main objectives: to reduce its computational time and to improve its accuracy. In this paper, we collect the main approaches which improve the computational time of the standard Fast Marching Method, focusing on single-threaded methods and isotropic environments. 9 different methods are studied under a common mathematical framework and experimentally in representative environments: Fast Marching Method with binary heap, Fast Marching Method with Fibonacci Heap, Simplified Fast Marching Method, Untidy Fast Marching Method, Fast Iterative Method, Group Marching Method, Fast Sweeping Method, Lock Sweeping Method and Double Dynamic Queue Method.
