n-Dimensional Fast Methods  0.7
 All Classes Functions Variables Typedefs Pages
fmmstar.hpp
1 
43 #ifndef FMMStar_HPP_
44 #define FMMStar_HPP_
45 
46 #include <iostream>
47 #include <cmath>
48 #include <algorithm>
49 #include <numeric>
50 #include <fstream>
51 #include <array>
52 
53 #include <fast_methods/fm/fmm.hpp>
54 
55 #include <fast_methods/ndgridmap/fmcell.h>
56 #include <fast_methods/datastructures/fmdaryheap.hpp>
57 
58 #include <fast_methods/ndgridmap/ndgridmap.hpp>
59 #include <fast_methods/console/console.h>
60 
61 template < class grid_t, class heap_t = FMDaryHeap<FMCell> > class FMMStar : public FMM<grid_t, heap_t> {
62 
65 
66  public:
67  FMMStar(HeurStrategy h = TIME) : FMMBase("FMM*", h) {
69  //if (static_cast<FMFibHeap>(heap_t))
70  // name_ = "FMMStarFib";
71  }
72 
73  FMMStar(const char * name, HeurStrategy h = TIME) : FMMBase(name, h){}
74 };
75 
76 #endif /* FMMSTAR_HPP_*/
Encapsulates the calls to FMM with heuristics enabled.
Definition: fmmstar.hpp:61
FMM< grid_t, heap_t > FMMBase
Shorthand for base solver.
Definition: fmmstar.hpp:64
FMMStar(HeurStrategy h=TIME)
Definition: fmmstar.hpp:67
Implements the Fast Marching Method (FMM).
Definition: fmm.hpp:64