Fast Methods for Eikonal Equations: An Experimental Survey

Authors:
Open Access
Publisher website
Google Scholar
Abstract
Fast Methods are very popular algorithms to compute time-of-arrival maps (distance maps measured in time units) solving the Eikonal equation. Since Fast Marching was proposed in 1995, it has been applied to many different applications such as robotics, medical computer vision, fluid simulation, etc. From then on, many alternatives to the original method have been proposed with two main objectives: reducing its computational time and improving its accuracy. In this paper, we collect the main single-threaded approaches, which improve the computational time of the standard Fast Marching Method and study them within a common mathematical framework. Then, they are evaluated using isotropic environments which are representative of their possible applications. The studied methods are: the 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, Locking Sweeping Method and Double Dynamic Queue Method.

This publication has 52 references indexed in Scilit: