octree.h

Go to the documentation of this file.

#ifndef MYOCTREE_OCTREE_H_
#define MYOCTREE_OCTREE_H_
#include <stdio.h>
#include <list>
#include <vector>
#include "block.h"
#include "boundary.h"

namespace myOctree {


//class forward declaration
class Octree;
extern std::list<Octree*> nodes;


class Octree {

    public:
    Octree(); 
    Octree( double x1, double x2, double y1, double y2, double z1, double z2, int l ); 
        Octree(const Octree &obj); 
    ~Octree(); 
    void refine(); 
    bool isLeafNode(); 
    bool isRootNode(); 
    /*change it to containsPoint*/
    bool contains(double x, double y, double z); 
    int get_level(); 
    Octree* get_child_at(int, int, int); 
    Octree* get_parent(); 
    void set_child_null_at(int, int, int); 
    Block* get_block_data(); 
    void set_to_refine_with_nesting(); 
    void set_to_coarsen_with_nesting(); 
    bool setToRefine; 
    bool setToCoarsen; 
    //neighbors
    /*change this to neighbour[direction][position]*/
//  Octree *east;
//  Octree *west;
//  Octree *north;
//  Octree *south;
//  Octree *top;
//  Octree *bottom;

    Octree *neighbour[3][2];

    //boundary conditions
    /*same as above */
//  NodeBc east_bc;
//  NodeBc west_bc;
//  NodeBc north_bc;
//  NodeBc south_bc;
//  NodeBc top_bc;
//  NodeBc bottom_bc;

    NodeBc bc[3][2]; 
    //boundary values
    /*same as above */
//  double east_bc_val;
//  double west_bc_val;
//  double north_bc_val;
//  double south_bc_val;
//  double top_bc_val;
//  double bottom_bc_val;
    
    double x_centre, y_centre, z_centre;
    double x_min, x_max;
    double y_min, y_max;
    double z_min, z_max;


    int number;

    
    private:
    Octree *children[2][2][2]; 
    Block *block_data; 
    Octree *parent; 
    int level; 
    protected:  

};


}
#endif