class BHInternalNode extends BHNode
| Modifier and Type | Field and Description |
|---|---|
(package private) static boolean |
debug2 |
(package private) BHNode |
lChild |
(package private) BHNode |
rChild |
BH_TYPE_INTERNAL, BH_TYPE_LEAF, bHull, debug, mark, nodeType, NUMBER_OF_PLANES, parent| Constructor and Description |
|---|
BHInternalNode() |
BHInternalNode(BHNode parent) |
BHInternalNode(BHNode parent,
BHNode rChild,
BHNode lChild) |
BHInternalNode(BHNode parent,
BHNode rChild,
BHNode lChild,
BoundingBox bHull) |
BHInternalNode(BHNode parent,
BoundingBox bHull) |
| Modifier and Type | Method and Description |
|---|---|
(package private) void |
computeBoundingHull() |
(package private) void |
computeBoundingHull(BoundingBox bHull) |
(package private) void |
destroyTree(BHNode[] bhArr,
int[] index) |
(package private) BHNode |
getLeftChild() |
(package private) BHNode |
getRightChild() |
(package private) void |
insert(BHNode node,
BHInsertStructure insertStructure) |
(package private) void |
setLeftChild(BHNode child) |
(package private) void |
setRightChild(BHNode child) |
(package private) void |
updateMarkedBoundingHull() |
combineBHull, computeAverageLeafDepth, computeMaxDepth, computeSumOfDepths, countNumberOfInternals, countNumberOfLeaves, deleteAndUpdateMarkedNodes, deleteFromParent, findNode, getBoundingHull, getParent, isInside, setBoundingHull, setParentBHInternalNode()
BHInternalNode(BHNode parent)
BHInternalNode(BHNode parent, BoundingBox bHull)
BHInternalNode(BHNode parent, BHNode rChild, BHNode lChild, BoundingBox bHull)
BHNode getLeftChild()
BHNode getRightChild()
void setLeftChild(BHNode child)
void setRightChild(BHNode child)
void computeBoundingHull(BoundingBox bHull)
void computeBoundingHull()
computeBoundingHull in class BHNodevoid updateMarkedBoundingHull()
updateMarkedBoundingHull in class BHNodevoid insert(BHNode node, BHInsertStructure insertStructure)
void destroyTree(BHNode[] bhArr, int[] index)
destroyTree in class BHNodeCopyright 1996-2008 Sun Microsystems, Inc. All Rights Reserved. Use is subject to license terms.