amr3t.h

Go to the documentation of this file.

/*
**
** File: PFS3tree.h 
**
** Author: Mauricio Riguette Mediano
**
** Date: 28/03/1997
**
*/

#ifndef pfs_PFS3tree_h
#define pfs_PFS3tree_h

#include <math.h>
#define RT3_MAX_NUM_NODES 100

#ifndef ABS
#define ABS(x)  (((x)>= 0)?(x): -(x))
#endif

#ifndef MIN
#define MIN(x,y)  (((x)<(y))?(x):(y))
#endif

#ifndef MAX
#define MAX(x,y)  (((x)>(y))?(x):(y))
#endif

#ifndef double_MAX
#define double_MAX 1.6e+300                      
#endif

#ifndef double_MIN
#define double_MIN 1.6e-300                      
#endif

class PFS3Box
{
  public:
    double Xmin,Ymin,Zmin,Xmax,Ymax,Zmax;
    void Dup(PFS3Box *B);
    int Equal(PFS3Box *);
    int Disjoint(PFS3Box *);
    double Volume();
    void ExtendVolume(PFS3Box *);
};

class PFS3BoxId:public PFS3Box
{
public:
  void *P;
};

class PFS3NodeBoxId
{
  int  Num;
  int  Max;
  int  Min;
protected:
  PFS3BoxId *Vet;
public:
  PFS3NodeBoxId(int Pmin, int Pmax);
  virtual ~PFS3NodeBoxId();
  int  Number () {return Num;};
  void Start () {Num=0;};
  void Dup(PFS3NodeBoxId *Fromn);
  void BBox (PFS3Box *B);
  void MakeBoxId(PFS3BoxId *Node);
  void GetPos(PFS3BoxId *E,int i);
  void PutPos(PFS3BoxId *E,int i);
  void Insert(PFS3BoxId *E,int Posit);
  void Append(PFS3BoxId *E);
  void Remove(int i);
  void Remove(PFS3BoxId *E,int Cont);
  void Remove(PFS3BoxId *E);
  void ChooseBoxId(PFS3BoxId *ebox,PFS3BoxId *Out,int *Posit);
  void UpdateBox(PFS3Box *B,int Posit);
  int  LocateBoxId(PFS3BoxId *In,int *Posit);
  void SplitNodeR3tree(PFS3NodeBoxId *Newnode);
};

class PFS3Rtree 
{
protected:
  int  Max;
  int  Min;
  int Level;
  PFS3NodeBoxId *Root;
  
  /* Estes atributos mantem uma pilha (log(n)) de nos da arvore, para    */
  /* retornar passo a passo (Result) cada box selecionado  por uma busca */
  /* na R3tree (Search).                                                 */

  PFS3NodeBoxId *Vnode[RT3_MAX_NUM_NODES];
  int Vpos[RT3_MAX_NUM_NODES];
  int NumL;
  PFS3Box SearchVal;

  int Remove(PFS3NodeBoxId *Node,PFS3BoxId *In,int Lev);
  void Delete(PFS3NodeBoxId *Node,int Lev);
  void Number(PFS3NodeBoxId *Node,int *num,int Lev);
  void MergeRoot();
  void Merge(PFS3NodeBoxId *Father,PFS3NodeBoxId *Node,short Posit);
  int Insert(PFS3NodeBoxId *Node,PFS3BoxId *In,PFS3BoxId *Out,int Lev);
  void SplitNodeR3tree(PFS3NodeBoxId *Node, PFS3BoxId *Out);
  void Print( PFS3NodeBoxId *Node, int ident, int *num, int Lev);

public:
  PFS3Rtree(int Nmin,int Nmax);
  virtual ~PFS3Rtree();
  void Insert(PFS3BoxId *newentry);
  int Remove(PFS3BoxId *newentry);

  void Print();
  void Create();
  void Delete();
  int  Number();
  void BBox(PFS3Box *B);
  void Search(PFS3Box *B);
  int  Result(PFS3BoxId *B);
  void SearchAll();
  int  ResultAll(PFS3BoxId *B);
};

#endif

---