Second Order Multi-Stencil Fast Marching Method

This code allows the computation of 2D and 3D shortest time of arrival maps given a local cost map and a mask with the initial front as inputs. A centered scheme with second order acuracy for the derivatives is employed, as well as a multi-stencil approach. Euclidean distance maps can be built with it by having the local cost be unitary on the whole domain.

The software is stored in github It requires the ITK toolkit and Boost to build it. If you use this software, please include the following reference:

Merino-Caviedes, S., Cordero-Grande, L., Perez, M. T., Casaseca-de-la-Higuera, P., Martin-Fernandez, M., Deriche, R., Alberola-Lopez, C. (2019). A Second Order Multi-Stencil Fast Marching Method With a Non-Constant Local Cost Model. IEEE Transactions on Image Processing, 28(4), 1967–1979. https://doi.org/10.1109/TIP.2018.2880507