| Class | Description |
|---|---|
| ClipConvexPolytopeKDTree<T> |
Partition nodes in a
KDTree into disjoint sets of nodes that are
inside and outside a given convex polytope, respectively. |
| ConvexPolytope | |
| HyperPlane | |
| KDTreeNodeIterable<T> | |
| SplitHyperPlaneKDTree<T> |
Partition nodes in a
KDTree into disjoint sets of nodes that are
above and below a given hyperplane, respectively. |
| VolumetricSearch<I extends RealInterval> |
The volumetric search uses a K-D tree to search for all hyper-rectangular
nodes that contain a given point.
|
Copyright © 2015–2022 ImgLib2. All rights reserved.