PointLocation.h

#ifndef POINT_LOCATION_H
#define POINT_LOCATION_H

#include "CSpace.h"
#include <KrisLibrary/geometry/KDTree.h>
#include <KrisLibrary/geometry/Grid.h>

class PointLocationBase
{
 public:
  PointLocationBase(std::vector<Vector>& _points);
  virtual ~PointLocationBase() {}
  virtual void OnBuild() =0;
  virtual void OnAppend() =0;
  virtual bool OnDelete(int id) { return false; }
  virtual bool OnClear() { return false; }
  virtual bool Exact() { return true; }
  virtual bool NN(const Vector& p,int& nn,Real& distance) { return false; }
  virtual bool KNN(const Vector& p,int k,std::vector<int>& nn,std::vector<Real>& distances) { return false; }
  virtual bool Close(const Vector& p,Real r,std::vector<int>& neighbors,std::vector<Real>& distances) { return false; }
  virtual bool FilteredNN(const Vector& p,bool (*filter)(int),int& nn,Real& distance) { return false; }
  virtual bool FilteredKNN(const Vector& p,int k,bool (*filter)(int),std::vector<int>& nn,std::vector<Real>& distances) { return false; }
  virtual bool FilteredClose(const Vector& p,Real r,bool (*filter)(int),std::vector<int>& neighbors,std::vector<Real>& distances) { return false; }

  std::vector<Vector>& points;
};

class NaivePointLocation : public PointLocationBase
{
 public:
  NaivePointLocation(std::vector<Vector>& points,CSpace* _space);
  virtual void OnBuild() {}
  virtual void OnAppend() {}
  virtual bool OnDelete(int id) { return true; }
  virtual bool OnClear() { return true; }
  virtual bool NN(const Vector& p,int& nn,Real& distance);
  virtual bool KNN(const Vector& p,int k,std::vector<int>& nn,std::vector<Real>& distances);
  virtual bool Close(const Vector& p,Real r,std::vector<int>& nn,std::vector<Real>& distances);
  virtual bool FilteredNN(const Vector& p,bool (*filter)(int),int& nn,Real& distance);
  virtual bool FilteredKNN(const Vector& p,int k,bool (*filter)(int),std::vector<int>& nn,std::vector<Real>& distances);
  virtual bool FilteredClose(const Vector& p,Real r,bool (*filter)(int),std::vector<int>& neighbors,std::vector<Real>& distances);


  CSpace* space;
};

class RandomPointLocation : public PointLocationBase
{
 public:
  RandomPointLocation(std::vector<Vector>& points);
  virtual void OnBuild() {}
  virtual void OnAppend() {}
  virtual bool OnDelete(int id) { return true; }
  virtual bool OnClear() { return true; }
  virtual bool Exact() { return false; }
  virtual bool NN(const Vector& p,int& nn,Real& distance);
  virtual bool KNN(const Vector& p,int k,std::vector<int>& nn,std::vector<Real>& distances);
  virtual bool FilteredNN(const Vector& p,bool (*filter)(int),int& nn,Real& distance);
  virtual bool FilteredKNN(const Vector& p,int k,bool (*filter)(int),std::vector<int>& nn,std::vector<Real>& distances);
};

class RandomBestPointLocation : public PointLocationBase
{
 public:
  RandomBestPointLocation(std::vector<Vector>& points,CSpace* _space,int k=1);
  virtual void OnBuild() {}
  virtual void OnAppend() {}
  virtual bool OnDelete(int id) { return true; }
  virtual bool OnClear() { return true; }
  virtual bool Exact() { return false; }
  virtual bool NN(const Vector& p,int& nn,Real& distance);
  virtual bool KNN(const Vector& p,int k,std::vector<int>& nn,std::vector<Real>& distances);
  virtual bool FilteredNN(const Vector& p,bool (*filter)(int),int& nn,Real& distance);
  virtual bool FilteredKNN(const Vector& p,int k,bool (*filter)(int),std::vector<int>& nn,std::vector<Real>& distances);

  CSpace* space;
  int k;
};


class KDTreePointLocation : public PointLocationBase
{
 public:
  KDTreePointLocation(std::vector<Vector>& points);
  KDTreePointLocation(std::vector<Vector>& points,Real norm,const Vector& weights);
  virtual ~KDTreePointLocation();
  virtual void OnBuild();
  virtual void OnAppend();
  virtual bool OnClear();
  virtual bool NN(const Vector& p,int& nn,Real& distance);
  virtual bool KNN(const Vector& p,int k,std::vector<int>& nn,std::vector<Real>& distances);
  virtual bool Close(const Vector& p,Real r,std::vector<int>& nn,std::vector<Real>& distances);

  Real norm;
  Vector weights;
  Geometry::KDTree* tree;
};


#endif