Beta2 Release

• Benchmarking can save only a grid per solver or grid for all runs with option savegrid=1 or savegrid=2
• Benchmarking CFG files now accept .grid textfiles under the option text=<path_to_text_grid>
• Added install and uninstall CMake targets.
• Renamed library to Fast Methods.
• Changed directory structure and includes.

New Beta Release

A new, improved version, with following changes:

• Added another hierarchy layer: EikonalSolver.
• Eikional solver member function (now in EikonalSolver) made more stable, but a bit less efficient (negligible in 2D and 3D, not tested in higher dimensions).
• Added 3 new solvers!
  • FSM: Fast Sweeping Method.
  • LSM: Lock Sweeping Method.
  • DDQM: Dynamic Double Queue Method.
• Some small tweaks, improvements and better documentation.

Beta Release

Finally, after a lot of work, I have decided to create a stable release for this code.

Change log:

• Library completely redesigned. Some small changes in the API.
• Examples rewritten.
• Documentation improved.
• API reference online: http://jvgomez.github.io/fastmarching
• FM2Dir removed, code refactorization is required.
• Automatic bechmark capabilities included.
• Fixes, and other minor changes.

First Pre-release

The code works properly for all our needs. There are a lot of features missing (mainly additional features as more efficient memory management, more user input/output choices, etc) but they are going to be implemented under demand since we are more focused on the core methods.

This pre-release includes:
Low level algorithms

• FMM (Fast Marching Method): with different heaps (binary, Fibonacci and boost priority queue (vector)).
• SFMM (Simplified Fast Marching Method): this is achieved using the boost priority queue on the standard FMM. The code automatically performs SFMM.

High level algorithms

• FM2 (Fast Marching Square).
• FM2* (Fast Marching Square ) FM2 is to FM2 what A* is to Dijsktra.
• FM2D (Fast Marching Square Directional).