GPUMarching is a GPU-based library that allows to compute the result of the eikonal equation. Contrary to the famous Fast Marching methods [1], it is based on a Fast Iterative Method [2], which allows to handle several points of the advancing front in parallel. Written in C++ and GLSL, it defines a general framework for GPGPU algorithms which can be used in other context. It can be compiled on several platforms thanks to the CMake cross-compilation tool.  GPUMarching is distributed under the CeCILL-B License.

Instructions:

1. -Unzip archive in the destination folder
   

2. -Use cmake on the root directory , then build.
   

Contact author:

Nicolas.Courty@univ-ubs.fr

References

[1]. Kimmel, R., Sethian, J.: Optimal algorithm for shape from shading and path planning. J. of Math. Ima. and Vis. 14 (2001) 237–244

[2] Jeong, W.K., Whitaker, R.: A fast eikonal equation solver for parallel systems. In: SIAM conf. on CSE, Costa Mesa, California (2007) 1–6