SearchTree.hpp

Go to the documentation of this file.

/*
*  SearchTree.hpp
*
*       Created on: 02.01.2012
*           Author: Florian Otte, Thomas Wiemann
 */

#ifndef LVR2_RECONSTRUCTION_SEARCHTREE_H_
#define LVR2_RECONSTRUCTION_SEARCHTREE_H_

#include <vector>

namespace lvr2
{

template< typename BaseVecT>
class SearchTree
{
private:
    using CoordT = typename BaseVecT::CoordType;

public:

    virtual ~SearchTree() = default;

    virtual int kSearch(
        const BaseVecT& qp,
        int k,
        std::vector<size_t>& indices,
        std::vector<CoordT>& distances
    ) const = 0;

    virtual void radiusSearch(
        const BaseVecT& qp,
        CoordT r,
        std::vector<size_t>& indices
    ) const = 0;

    virtual int kSearch(
        const BaseVecT& qp,
        int k,
        std::vector<size_t>& indices
    ) const;

    // /**
    //  * @brief Set the number of neighbours used to estimate and interpolate normals.
    //  */
    // virtual void setKi(int ki);


    // /**
    //  * @brief Set the number of neighbours used for normal estimation
    //  */
    // virtual void setKd(int kd);

    // /**
    //  * @brief Get the number of tangent planes used for distance determination
    //  */
    // virtual int getKi();


    // /**
    //  * @brief Get the number of neighbours used to estimate and interpolate normals.
    //  */
    // virtual int getKd();


protected:
    int                         m_ki;

    int                         m_kd;
};

template <typename BaseVecT>
using SearchTreePtr = std::shared_ptr<SearchTree<BaseVecT>>;

} // namespace lvr2

#include "SearchTree.tcc"

#endif // LVR2_RECONSTRUCTION_SEARCHTREE_H_