AABBNoLeafNode Class Reference

#include <OPC_OptimizedTree.h>

Related Functions
(Note that these are not member functions.)
	_BuildNoLeafTree (AABBNoLeafNode *linear, const udword box_id, udword &current_id, const AABBTreeNode *current_node)

Detailed Description

Definition at line 102 of file OPC_OptimizedTree.h.

Friends And Related Function Documentation

_BuildNoLeafTree ( AABBNoLeafNode *  linear, const udword  box_id, udword &  current_id, const AABBTreeNode *  current_node  )

related

Builds a "no-leaf" tree from a standard one. This is a tree whose leaf nodes have been removed.

Layout for no-leaf trees:

Node:

• box
• P pointer => a node (LSB=0) or a primitive (LSB=1)
• N pointer => a node (LSB=0) or a primitive (LSB=1)

Parameters

linear	[in] base address of destination nodes
box_id	[in] index of destination node
current_id	[in] current running index
current_node	[in] current node from input tree

Definition at line 152 of file OPC_OptimizedTree.cpp.

{
    const AABBTreeNode* P = current_node->GetPos();
    const AABBTreeNode* N = current_node->GetNeg();
    // Leaf nodes here?!
    OPASSERT(P);
    OPASSERT(N);
    // Internal node => keep the box
    current_node->GetAABB()->GetCenter(linear[box_id].mAABB.mCenter);
    current_node->GetAABB()->GetExtents(linear[box_id].mAABB.mExtents);

    if(P->IsLeaf())
    {
        // The input tree must be complete => i.e. one primitive/leaf
        OPASSERT(P->GetNbPrimitives()==1);
        // Get the primitive index from the input tree
        udword PrimitiveIndex = P->GetPrimitives()[0];
        // Setup prev box data as the primitive index, marked as leaf
        linear[box_id].mPosData = (PrimitiveIndex<<1)|1;
    }
    else
    {
        // Get a new id for positive child
        udword PosID = current_id++;
        // Setup box data
        linear[box_id].mPosData = (uintptr_t)&linear[PosID];
        // Make sure it's not marked as leaf
        OPASSERT(!(linear[box_id].mPosData&1));
        // Recurse
        _BuildNoLeafTree(linear, PosID, current_id, P);
    }

    if(N->IsLeaf())
    {
        // The input tree must be complete => i.e. one primitive/leaf
        OPASSERT(N->GetNbPrimitives()==1);
        // Get the primitive index from the input tree
        udword PrimitiveIndex = N->GetPrimitives()[0];
        // Setup prev box data as the primitive index, marked as leaf
        linear[box_id].mNegData = (PrimitiveIndex<<1)|1;
    }
    else
    {
        // Get a new id for negative child
        udword NegID = current_id++;
        // Setup box data
        linear[box_id].mNegData = (uintptr_t)&linear[NegID];
        // Make sure it's not marked as leaf
        OPASSERT(!(linear[box_id].mNegData&1));
        // Recurse
        _BuildNoLeafTree(linear, NegID, current_id, N);
    }
}

---

The documentation for this class was generated from the following files:

• src/cmd/collide2/OPC_OptimizedTree.h
• src/cmd/collide2/OPC_OptimizedTree.cpp