public class NNSRealPointCollection<L extends RealLocalizable> extends AbstractEuclideanSpace implements RealPointCollection<L>
RealPointCollection which checks if points are in the collection by
performing a NearestNeighborSearch on the provided
IterableRealInterval.| Modifier and Type | Field and Description |
|---|---|
protected IterableRealInterval<L> |
interval |
protected NearestNeighborSearch<L> |
search |
n| Constructor and Description |
|---|
NNSRealPointCollection(IterableRealInterval<L> interval)
Creates a
RealPointCollection. |
NNSRealPointCollection(IterableRealInterval<L> interval,
NearestNeighborSearch<L> search)
Creates a
RealPointCollection. |
| Modifier and Type | Method and Description |
|---|---|
boolean |
equals(Object obj)
Determines whether this point collection describes the same region as
another one.
|
int |
hashCode() |
IterableRealInterval<L> |
points()
Returns the points in the collection.
|
void |
realMax(double[] max)
Write the maximum of each dimension into double[].
|
double |
realMax(int d)
Get the maximum in dimension d.
|
void |
realMax(RealPositionable max)
Sets a
RealPositionable to the maximum of this Interval |
void |
realMin(double[] min)
Write the minimum of each dimension into double[].
|
double |
realMin(int d)
Get the minimum in dimension d.
|
void |
realMin(RealPositionable min)
Sets a
RealPositionable to the minimum of this Interval |
long |
size()
Returns the number of points in the collection.
|
boolean |
test(RealLocalizable l) |
numDimensionsclone, finalize, getClass, notify, notifyAll, toString, wait, wait, waitboundaryType, equals, hashCode, maskTypeand, isEmpty, minus, or, transform, xorisAll, knownConstantnumDimensionsmaxAsDoubleArray, maxAsRealPoint, minAsDoubleArray, minAsRealPointprotected IterableRealInterval<L extends RealLocalizable> interval
protected NearestNeighborSearch<L extends RealLocalizable> search
public NNSRealPointCollection(IterableRealInterval<L> interval)
RealPointCollection.interval - Contains the points which will be included in this collection.
This will be used to create a
NearestNeighborSearchOnIterableRealInterval.The first
point determines the dimensionality of the collection.public NNSRealPointCollection(IterableRealInterval<L> interval, NearestNeighborSearch<L> search)
RealPointCollection.interval - Contains the points which will be included in this collection.
This will be used to create a
NearestNeighborSearchOnIterableRealInterval. The first
point determines the dimensionality of the collection.search - Will be used to check if a point is contained by the
collection.public boolean test(RealLocalizable l)
test in interface Predicate<RealLocalizable>public double realMin(int d)
RealIntervalrealMin in interface RealIntervald - dimensionpublic void realMin(double[] min)
RealIntervalrealMin in interface RealIntervalrealMin in interface RealMaskRealIntervalpublic void realMin(RealPositionable min)
RealIntervalRealPositionable to the minimum of this IntervalrealMin in interface RealIntervalrealMin in interface RealMaskRealIntervalpublic double realMax(int d)
RealIntervalrealMax in interface RealIntervald - dimensionpublic void realMax(double[] max)
RealIntervalrealMax in interface RealIntervalrealMax in interface RealMaskRealIntervalpublic void realMax(RealPositionable max)
RealIntervalRealPositionable to the maximum of this IntervalrealMax in interface RealIntervalrealMax in interface RealMaskRealIntervalpublic IterableRealInterval<L> points()
RealPointCollectionpoints in interface RealPointCollection<L extends RealLocalizable>public long size()
RealPointCollectionsize in interface RealPointCollection<L extends RealLocalizable>public boolean equals(Object obj)
RealPointCollectionequals in interface RealPointCollection<L extends RealLocalizable>equals in interface MaskPredicate<RealLocalizable>equals in class Objectobj - The point collection to compare with this one.MaskPredicate.equals(Object),
RealPointCollection.equals(RealPointCollection, RealPointCollection)Copyright © 2015–2022 ImgLib2. All rights reserved.