n-Dimensional Fast Methods  0.7
 All Classes Functions Variables Typedefs Pages
sfmm.hpp
1 
29 #ifndef SFMM_HPP_
30 #define SFMM_HPP_
31 
32 #include <iostream>
33 #include <cmath>
34 #include <algorithm>
35 #include <numeric>
36 #include <fstream>
37 #include <array>
38 
39 #include <fast_methods/fm/fmm.hpp>
40 
41 #include <fast_methods/ndgridmap/fmcell.h>
42 #include <fast_methods/datastructures/fmpriorityqueue.hpp>
43 
44 template < class grid_t, class cell_t = FMCell> class SFMM : public FMM<grid_t, FMPriorityQueue<cell_t>> {
45 
48 
49  public:
50  SFMM(HeurStrategy h = NOHEUR) : FMMBase("SFMM", h) {}
51  SFMM(const char * name, HeurStrategy h = NOHEUR) : FMMBase(name, h){}
52 };
53 
54 #endif /* SFMM_HPP_*/
Implements the Simplified Fast Marching Method, encapsulating FMM with a priority queue...
Definition: sfmm.hpp:44
FMM< grid_t, FMPriorityQueue< cell_t > > FMMBase
Shorthand for base solver.
Definition: sfmm.hpp:47
Implements the Fast Marching Method (FMM).
Definition: fmm.hpp:64