Fast methods for the Eikonal and related Hamilton-Jacobi equations on unstructured meshes

The Fast Marching Method is a numerical algorithm for solving the Eikonal e quation on a rectangular orthogonal mesh in O(M log M) steps, where M is th e total number of grid points. The scheme relies on an upwind finite differ ence approximation to the gradient and a resulting causality relationship t hat lends itself to a Dijkstra-like programming approach. In this paper, we discuss several extensions to this technique, including higher order versi ons on unstructured meshes in R-n and on manifolds and connections to more general static Hamilton-Jacobi equations.