Sheppard_fwd.hpp

Go to the documentation of this file.

#ifndef MEDUSA_BITS_INTERPOLANTS_SHEPPARD_FWD_HPP_
#define MEDUSA_BITS_INTERPOLANTS_SHEPPARD_FWD_HPP_
 
#include <medusa/bits/spatial_search/KDTree.hpp>
#include <medusa/bits/types/Range_fwd.hpp>
 
namespace mm {
 
template <class vec_t, class value_t>
class SheppardInterpolant {
  private:
    KDTree<vec_t> tree;                         
    Range<value_t> values;                      
    typedef typename vec_t::scalar_t scalar_t;  
 
  public:
    SheppardInterpolant() = default;
 
    explicit SheppardInterpolant(const Range<vec_t>& pos) : tree(pos) {
        int N = pos.size();
        assert_msg(N > 0, "Number of positions in the tree must be greater than 0, got %d.", N);
    }
 
    SheppardInterpolant(const Range<vec_t>& pos, const Range<value_t>& values)
            : tree(pos), values(values) {
        int N = pos.size();
        int M = values.size();
 
        assert_msg(N > 0, "Number of positions in the tree must be greater than 0, got %d.", N);
        assert_msg(N == M,
                   "Number of positions must equal number of values. Got %d positions in the tree "
                   "and %d values.",
                   N, M);
    }
 
    template <typename values_container_t>
    void setValues(const values_container_t& new_values) {
        values = Range<value_t>(new_values.begin(), new_values.end());
    }
 
    void setPositions(const Range<vec_t>& pos) { tree.reset(pos); }
 
    value_t operator()(const vec_t& point, int num_closest, int power = 2, double reg = 0.0,
                       double conf_dist = 1e-12) const;
};
 
}  // namespace mm
 
#endif  // MEDUSA_BITS_INTERPOLANTS_SHEPPARD_FWD_HPP_