btree.h

Go to the documentation of this file.

#ifndef BTREEH
#define BTREEH

#include "boolean.h"
#include "box.h"
#include "chart.h"

#if (_KDTREE==1)
  #include <cuik-kdtree/cuik-kdtree.h>
#endif
#if (_KDTREE==2)
  #include <DNN/ANN_C.h>
#endif

#define INIT_NUM_POINTS_IN_BTREE 1000

typedef struct {
  unsigned int m;       
  double r;             
  unsigned int *tp;     
  #if (_KDTREE==1)
    TKDtree *kdtree;    
  #endif
  #if (_KDTREE==2)
    TKDTree *kdtree;    
    unsigned int mp;    
    unsigned int np;    
    unsigned int *n2id; 
  #endif
} TBTree;

void InitBTree(unsigned int id,Tchart *mp,Tbox *ambient,unsigned int *topology,TBTree *t);

void AddChart2Btree(unsigned int id,Tchart *mp,TBTree *t);

boolean PointInBTree(double eps,double *p,TBTree *t);

void SearchInBtree(Tchart *mp,unsigned int *nn,unsigned int **n,TBTree *t);

void DeleteBTree(TBTree *t);

#endif