#include <Opcode.h>
Definition at line 84 of file Opcode.h.
Recursive hierarchy building in a top-down fashion.
- Parameters
-
builder | [in] the tree builder |
Definition at line 333 of file OPC_AABBTree.cpp.
Refits the tree (top-down).
- Parameters
-
builder | [in] the tree builder |
Definition at line 354 of file OPC_AABBTree.cpp.
Splits the node along a given axis. The list of indices is reorganized according to the split values.
- Parameters
-
axis | [in] splitting axis index |
builder | [in] the tree builder |
- Returns
- the number of primitives assigned to the first child
- Warning
- this method reorganizes the internal list of primitives
Definition at line 99 of file OPC_AABBTree.cpp.
Subdivides the node.
N
/ \
/ \
N/2 N/2 / \ / \ N/4 N/4 N/4 N/4 (etc)
A well-balanced tree should have a O(log n) depth. A degenerate tree would have a O(n) depth. Note a perfectly-balanced tree is not well-suited to collision detection anyway.
- Parameters
-
builder | [in] the tree builder |
- Returns
- true if success
Definition at line 150 of file OPC_AABBTree.cpp.
udword Opcode::AABBTreeNode::mNbPrimitives |
|
protected |
Number of primitives for this node.
Definition at line 95 of file Opcode.h.
udword* Opcode::AABBTreeNode::mNodePrimitives |
|
protected |
Node-related primitives (shortcut to a position in mIndices below)
Definition at line 94 of file Opcode.h.
The documentation for this class was generated from the following files: