T - type of values stored in the tree.public class ClipConvexPolytopeKDTree<T> extends Object
KDTree into disjoint sets of nodes that are
inside and outside a given convex polytope, respectively.
Construct with the KDTree. Call clip(ConvexPolytope) to
partition with respect to a ConvexPolytope. Then call
getInsideNodes() and getOutsideNodes() to get the sets of
nodes inside and outside the polytope, respectively.
The algorithm is described in this note.
| Constructor and Description |
|---|
ClipConvexPolytopeKDTree(KDTree<T> tree) |
| Modifier and Type | Method and Description |
|---|---|
void |
clip(ConvexPolytope polytope) |
void |
clip(double[][] planes) |
Iterable<KDTreeNode<T>> |
getInsideNodes() |
Iterable<KDTreeNode<T>> |
getOutsideNodes() |
int |
numDimensions() |
public int numDimensions()
public void clip(ConvexPolytope polytope)
public void clip(double[][] planes)
public Iterable<KDTreeNode<T>> getInsideNodes()
public Iterable<KDTreeNode<T>> getOutsideNodes()
Copyright © 2015–2022 ImgLib2. All rights reserved.