boundingBox | KDTree | [private] |
build(unsigned int nodeID, unsigned int *boundsArray, unsigned int nObjects, BoundingBox &limits, unsigned char axisNmask) | KDTree | [private] |
compare(unsigned int aIndex, unsigned int bIndex, unsigned char axis) | KDTree | [inline, private] |
createBoundingBox(Intersectable **iObjects, int nObjects) | KDTree | [inline, private] |
deleteLeaves(unsigned int nodeID) | KDTree | [private] |
findBound(unsigned int *extremeArrayStart, unsigned int nBounds, float loc, unsigned char axis) | KDTree | [private] |
followChildren(unsigned int &parent, unsigned int &leftChild, unsigned int &rightChild) | KDTree | [inline, private] |
freeNodes | KDTree | [private] |
getBoundValue(unsigned int *extremeIndex, unsigned char axis) | KDTree | [inline, private] |
getFreeNodes(unsigned int parent, unsigned int &leftFree, unsigned int &rightFree) | KDTree | [inline, private] |
isLeaf(unsigned int xnode) | KDTree | [inline, private] |
makePointer(unsigned int originalNode) | KDTree | [inline, private] |
maxNCacheLines | KDTree | [private] |
nCacheLineBytes | KDTree | [private] |
nCacheLineNodes | KDTree | [private] |
nCacheLines | KDTree | [private] |
nObjects | KDTree | [private] |
nodeTable | KDTree | [private] |
objects | KDTree | [private] |
poolNodeTable | KDTree | [private] |
quickSort(unsigned int *lo0, unsigned int *hi0, unsigned char axis) | KDTree | [private] |
traverseStack | KDTree | [private] |