Nearest.h

Go to the documentation of this file.

/*
 *  Copyright (C) 2012 Josh Bialkowski (jbialk@mit.edu)
 *
 *  This file is part of mpblocks.
 *
 *  mpblocks is free software: you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation, either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  mpblocks is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with mpblocks.  If not, see <http://www.gnu.org/licenses/>.
 */
#ifndef MPBLOCKS_KD_TREE_EUCLIDEAN_NEAREST_H_
#define MPBLOCKS_KD_TREE_EUCLIDEAN_NEAREST_H_


namespace  mpblocks {
namespace   kd_tree {
namespace euclidean {

template <class Traits>
class Nearest :
    public NearestSearchIface<Traits>
{
    public:
        typedef typename Traits::Format_t   Format_t;
        typedef typename Traits::Node       Node_t;

        typedef Distance<Traits>            Distance_t;
        typedef HyperRect<Traits>           HyperRect_t;

        typedef Eigen::Matrix<Format_t,Traits::NDim,1>  Point_t;

    private:
        Distance_t  m_dist2Fn;
        Format_t    m_d2Best;
        Node_t*     m_nBest;

    public:
        virtual ~Nearest(){};

        // reset d2Best to be infinity
        void reset( Format_t inf = std::numeric_limits<Format_t>::max() );

        // return the result
        Node_t* result();

        virtual void evaluate(const Point_t& q, const Point_t& p, Node_t* n);

        virtual bool shouldRecurse(const Point_t& q, const HyperRect_t& r );
};






} // namespace euclidean
} // namespace kd_tree
} // namespace mpblocks








#endif // NEARESTNEIGHBOR_H_