T - type of values stored in the tree.public class SplitHyperPlaneKDTree<T> extends Object
KDTree into disjoint sets of nodes that are
above and below a given hyperplane, respectively.
Construct with the KDTree. Call split(HyperPlane) to
partition with respect to a HyperPlane. Then call
getAboveNodes() and getBelowNodes() to get the sets of
nodes above and below the hyperplane, respectively.
The algorithm is described in this note.
| Constructor and Description |
|---|
SplitHyperPlaneKDTree(KDTree<T> tree) |
| Modifier and Type | Method and Description |
|---|---|
Iterable<KDTreeNode<T>> |
getAboveNodes() |
Iterable<KDTreeNode<T>> |
getBelowNodes() |
int |
numDimensions() |
void |
split(double[] plane) |
void |
split(HyperPlane plane) |
public int numDimensions()
public void split(HyperPlane plane)
public void split(double[] plane)
public Iterable<KDTreeNode<T>> getAboveNodes()
public Iterable<KDTreeNode<T>> getBelowNodes()
Copyright © 2015–2022 ImgLib2. All rights reserved.