kdtree.h

Go to the documentation of this file.

#ifndef included_AMP_kdtree
#define included_AMP_kdtree
 
#include <array>
#include <cstdint>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
 
 
namespace AMP::Mesh {
template<class TYPE>
class MeshPoint; // Forward declare MeshPoint
} // namespace AMP::Mesh
 
 
namespace AMP {
 
 
class kdtree
{
public:
    // Empty constructor
    kdtree() : d_dim( 0 ), d_N( 0 ), d_tree( nullptr ) {}
 
    kdtree( int ndim, size_t N, const double *const *x );
 
    kdtree( const std::vector<AMP::Mesh::MeshPoint<double>> &x );
 
    ~kdtree();
 
    kdtree( const kdtree & ) = delete;
 
    kdtree( kdtree && );
 
    kdtree &operator=( const kdtree & ) = delete;
 
    kdtree &operator=( kdtree && );
 
 
    static std::shared_ptr<kdtree> create2d( size_t N, const double *x, const double *y );
 
    static std::shared_ptr<kdtree>
    create3d( size_t N, const double *x, const double *y, const double *z );
 
 
    std::vector<double> box() const;
 
 
    void add( const double *x );
 
    AMP::Mesh::MeshPoint<double> find_nearest( const AMP::Mesh::MeshPoint<double> &p ) const;
 
    size_t find_nearest( const double *x, double *dist = nullptr, double *pos = nullptr ) const;
 
    void find_nearest( int N,
                       const double *x,
                       size_t *index,
                       double *dist = nullptr,
                       double *pos  = nullptr ) const;
 
    size_t find_nearest2d( const double x, const double y ) const;
 
    size_t find_nearest3d( const double x, const double y, const double z ) const;
 
 
private: // Internal data
    uint8_t d_dim;
    size_t d_N;
    void *d_tree;
 
    // Find the nearest point in the tree to x
    size_t find_nearest2( const double *x, double &dist, double *pos ) const;
};
 
 
} // namespace AMP
 
 
#endif