八叉树 ( 1 )

1234567891011

cin>>choiced; while(true){        if(choiced == 0)   return 0;        else if(choiced == 1)        {…………        } …………}

12345678910111213

template<class T>struct OctreeNode{T data; //节点数据 T xmin,xmax; //节点坐标，即六面体个顶点的坐标 T ymin,ymax; T zmin,zmax;    OctreeNode <T> *top_left_front,*top_left_back; //该节点的8个子结点,即个子六面体    OctreeNode <T> *top_right_front,*top_right_back;    OctreeNode <T> *bottom_left_front,*bottom_left_back;OctreeNode <T> *bottom_right_front,*bottom_right_back;…………};

12345678910111213141516171819

void createOctree(OctreeNode<T> * &root,int maxdepth,double xmin,double xmax,double ymin,double ymax,double zmin,double zmax){ maxdepth=maxdepth-1; //每递归一次就将最大递归深度-1 if(maxdepth>=0) {  root=new OctreeNode<T>();  root->xmin=xmin; //为节点坐标赋值  root->xmax=xmax;………………  double xm=(xmax-xmin)/2;  double ym=(ymax-ymin)/2;  double zm=(ymax-ymin)/2; //计算节点3个维度上的半边长   //递归创建子树，根据每一个节点所处（是几号节点）的位置决定其子结点的坐标。 createOctree(root->top_left_front,maxdepth,xmin,xmax-xm,ymax-ym,ymax,zmax-zm,zmax); createOctree(root->top_left_back,maxdepth,xmin,xmax-xm,ymin,ymax-ym,zmax-zm,zmax); ……………… //8个子结点 }}

1234567891011121314

int i=1;template <class T>void preOrder( OctreeNode<T> * & p){    if(p)    { cout<<i<<".当前节点的值为："<<p->data<<"/n坐标为：";  cout<<" xmin: "<<p->xmin<<" xmax: "<<p->xmax;…………  i+=1;        preOrder(p->top_left_front);        preOrder(p->top_left_back);………………    }}

12345678

template<class T>int depth(OctreeNode<T> *& p){    if(p == NULL)        return -1;    int h = depth(p->top_left_front);    return h+1;}