P
- Point typeN
- BSP tree node implementation typepublic static interface BSPTree.Node<P extends Point<P>,N extends BSPTree.Node<P,N>> extends BSPSubtree<P,N>
Modifier and Type | Method and Description |
---|---|
int |
depth()
Get the depth of the node in the tree.
|
HyperplaneConvexSubset<P> |
getCut()
Get the cut for the node.
|
Hyperplane<P> |
getCutHyperplane()
Get the hyperplane containing the node cut, if it exists.
|
N |
getMinus()
Get the node for the minus region of the cell.
|
N |
getParent()
Get the parent of the node.
|
N |
getPlus()
Get the node for the plus region of the cell.
|
BSPTree<P,N> |
getTree()
Get the
BSPTree that owns the node. |
boolean |
isInternal()
Return true if the node is an internal node, meaning that is
has a binary partitioner (aka "cut") and therefore two child nodes.
|
boolean |
isLeaf()
Return true if the node is a leaf node, meaning that it has no
binary partitioner (aka "cut") and therefore no child nodes.
|
boolean |
isMinus()
Return true if the node has a parent and is the parent's minus
child.
|
boolean |
isPlus()
Return true if the node has a parent and is the parent's plus
child.
|
HyperplaneConvexSubset<P> |
trim(HyperplaneConvexSubset<P> sub)
Trim the given hyperplane subset to the region defined by this node by cutting
the argument with the cut hyperplanes (binary partitioners) of all parent nodes
up to the root.
|
accept, count, height, nodes
int depth()
N getParent()
HyperplaneConvexSubset<P> getCut()
getPlus()
,
getMinus()
,
getCutHyperplane()
Hyperplane<P> getCutHyperplane()
getCut()
N getMinus()
N getPlus()
boolean isLeaf()
boolean isInternal()
boolean isMinus()
boolean isPlus()
HyperplaneConvexSubset<P> trim(HyperplaneConvexSubset<P> sub)
sub
- the hyperplane subset to trimCopyright © 2016–2021 The Apache Software Foundation. All rights reserved.