---

---

AI_SDB_SpatialAABBTree.h

Go to the documentation of this file.

#ifndef AI_SDB_SPATIALAABBTREE_H
#define AI_SDB_SPATIALAABBTREE_H

#include "AI_SDB_SpatialElements.h"

class AI_SDB_SpatialAABBTreeNode;


class AI_SDB_SpatialAABBTree : public AI_SDB_SpatialHierarchyElement
{
public:
    AI_SDB_SpatialAABBTree();
    ~AI_SDB_SpatialAABBTree();

    void ClearNodes();

    void AddElement(AI_SDB_SpatialElement *appendme);
    void RemoveElement(AI_SDB_SpatialElement *removeme);
    void MoveElement(AI_SDB_SpatialElement *moveme, const AI_BBox &newbox);

    virtual void Accept(AI_SDB_VisibilityVisitor &visitor, int recursiondepth, AI_SDB_VisitorFlags flags);
    virtual void Accept(AI_SDB_SpatialVisitor &visitor, int recursiondepth, AI_SDB_VisitorFlags flags);
    virtual void Accept(AI_SDB_OcclusionVisitor &visitor, int recursiondepth, AI_SDB_VisitorFlags flags);

    // node management functions--should break this out into a separate class or something...
    // allocate a tree node
    AI_SDB_SpatialAABBTreeNode *alloc_node();

    // free a tree node
    void free_node(AI_SDB_SpatialAABBTreeNode *freeme);

protected:
    // the tree root
    AI_SDB_SpatialAABBTreeNode *m_treenodes;

    // other tree operations
    AI_SDB_SpatialAABBTreeNode *FindSuitableNode(const AI_Vector3 &v_center);
    void collapse_node(AI_SDB_SpatialAABBTreeNode *collapseme);
    void split_node(AI_SDB_SpatialAABBTreeNode *splitme);
    void balance_tree(AI_SDB_SpatialAABBTreeNode *treeroot);
};


class AI_SDB_SpatialAABBTreeNode {
public:
    AI_SDB_SpatialAABBTreeNode() : m_elementsinnode(0), m_totalelements(0), m_parent(NULL) 
    { m_children[0] = m_children[1] = NULL; }

    // destructor does nothing really
    ~AI_SDB_SpatialAABBTreeNode() { ai_assert(!HasChildren()); }

    // returns true if this node haschild nodes
    bool HasChildren() const { return (m_children[0] != NULL); }

    // adds element to this node
    void AddElement(AI_SDB_SpatialElement *addme);

    // finds the element in this node or child nodes; returns the containing tree node
    AI_SDB_SpatialAABBTreeNode *FindElement(AI_SDB_SpatialElement *findme);

    // removes the element from this node only; if it's not in this node, the call fails.
    // for proper use, find the containing treenode using FindElement() and call RemoveElement()
    // on that one
    void RemoveElement(AI_SDB_SpatialElement *removeme);

    // this function will divvy up the elements and stuff them into the child nodes
    void Subdivide(AI_SDB_SpatialAABBTree *nodemanager);

    // recompute the total element count
    void RecomputeElementCount();

    // recompute the bounding box
    void RecomputeBoundingBox();

    void ClearNodes(AI_SDB_SpatialAABBTree *nodemanager);

    // visitor processing
    void Accept(AI_SDB_VisibilityVisitor &visitor, int recursiondepth, AI_SDB_VisitorFlags flags);
    void Accept(AI_SDB_SpatialVisitor &visitor, int recursiondepth, AI_SDB_VisitorFlags flags);
    void Accept(AI_SDB_OcclusionVisitor &visitor, int recursiondepth, AI_SDB_VisitorFlags flags);

    // bbox for this node
    AI_BBox m_bbox;

    // split axis and position
    int m_splitaxis;  // 0=x,1=y,2=z
    float m_splitposition;

    enum { MAX_ELEMENTSPERNODE = 10 };

    // spatialelements in this node
    AI_SDB_SpatialElement *m_elements[MAX_ELEMENTSPERNODE];
    int m_elementsinnode;

    // total elements in this node and all of its children
    int m_totalelements;

    // pointers to other nodes
    AI_SDB_SpatialAABBTreeNode *m_children[2];
    AI_SDB_SpatialAABBTreeNode *m_parent;
};

#endif

---

InExIn pages are hosted by
InExIn documentation generated by doxygen at Tue Dec 18 12:55:27 2007