searchTree.h

Go to the documentation of this file.

#ifndef __SEARCHTREE_H__
#define __SEARCHTREE_H__

#include <vector>
using std::vector;

#include "searchCache.h"
#include "ptpair.h"
#include "data_types.h"

class Tree {
public:  
  virtual inline ~Tree() {};
};


class Scan;
class SearchTree : public Tree {
  friend class Scan;
public:
  inline SearchTree() {};
  
  SearchTree(double **pts, int n);

  virtual inline ~SearchTree() {};
  
  virtual inline void lock() {};
  
  virtual inline void unlock() {};

  virtual double *FindClosest(double *_p, double maxdist2, int threadNum = 0) const = 0 ;

  virtual void getPtPairs(vector <PtPair> *pairs, 
                                  double *source_alignxf, 
          double * const *q_points, unsigned int startindex, unsigned int endindex,
                                  int thread_num,
                                  int rnd, double max_dist_match2, double &sum,
                                  double *centroid_m, double *centroid_d);
    
  virtual void getPtPairs(vector <PtPair> *pairs,
                                  double *source_alignxf,
          const DataXYZ& xyz_r, unsigned int startindex, unsigned int endindex,
                                  int thread_num,
                                  int rnd, double max_dist_match2, double &sum,
                                  double *centroid_m, double *centroid_d);
};


class CachedSearchTree : public SearchTree {
public:  
  inline CachedSearchTree() {};

  CachedSearchTree(double **pts, int n, CachedSearchTree *_parent = 0);

  virtual inline ~CachedSearchTree() {};

  virtual SearchTreeCacheItem* FindClosestCacheInit(double *_p, double maxdist2, int threadNum = 0) = 0;

  virtual SearchTreeCacheItem* FindClosestCache(double *_p, double maxdist2, int threadNum = 0) = 0;
  double *FindClosest(double *_p, double maxdist2, int threadNum = 0) const {
    return 0; 
  }
};


#endif