| Package | Description |
|---|---|
| net.imglib2.interpolation.neighborsearch | |
| net.imglib2.neighborsearch | |
| net.imglib2.roi.geom.real |
| Modifier and Type | Field and Description |
|---|---|
protected NearestNeighborSearch<T> |
NearestNeighborSearchInterpolator.search |
| Modifier and Type | Method and Description |
|---|---|
NearestNeighborSearchInterpolator<T> |
NearestNeighborSearchInterpolatorFactory.create(NearestNeighborSearch<T> search)
Creates a new
NearestNeighborSearchInterpolator using a copy of
the passed NearestNeighborSearch. |
NearestNeighborSearchInterpolator<T> |
NearestNeighborSearchInterpolatorFactory.create(NearestNeighborSearch<T> search,
RealInterval interval)
Creates a new
NearestNeighborSearchInterpolator using a copy of
the passed NearestNeighborSearch. |
| Constructor and Description |
|---|
NearestNeighborSearchInterpolator(NearestNeighborSearch<T> search) |
| Modifier and Type | Interface and Description |
|---|---|
interface |
KNearestNeighborSearch<T>
k-nearest-neighbor search in an Euclidean space.
|
| Modifier and Type | Class and Description |
|---|---|
class |
KNearestNeighborSearchOnIterableRealInterval<T>
k-nearest-neighbor search on
IterableRealInterval
implemented as linear search. |
class |
KNearestNeighborSearchOnKDTree<T>
Implementation of
KNearestNeighborSearch search for kd-trees. |
class |
NearestNeighborSearchOnIterableRealInterval<T>
k-nearest-neighbor search on
IterableRealInterval
implemented as linear search. |
class |
NearestNeighborSearchOnKDTree<T>
Implementation of
NearestNeighborSearch search for kd-trees. |
| Modifier and Type | Method and Description |
|---|---|
NearestNeighborSearch<T> |
NearestNeighborSearch.copy()
Create a copy.
|
| Modifier and Type | Field and Description |
|---|---|
protected NearestNeighborSearch<L> |
NNSRealPointCollection.search |
| Constructor and Description |
|---|
NNSRealPointCollection(IterableRealInterval<L> interval,
NearestNeighborSearch<L> search)
Creates a
RealPointCollection. |
Copyright © 2015–2022 ImgLib2. All rights reserved.