Modifier and Type | Class and Description |
---|---|
class |
CASHInterval
Provides a unique interval represented by its id, a hyper bounding box
representing the alpha intervals, an interval of the corresponding distance,
and a set of objects ids associated with this interval.
|
Modifier and Type | Class and Description |
---|---|
class |
VarianceOfVolume<O extends SpatialComparable>
Variance of Volume for outlier detection.
|
static class |
VarianceOfVolume.Parameterizer<O extends SpatialComparable>
Parameterization class.
|
Modifier and Type | Interface and Description |
---|---|
interface |
NumberVector
Interface NumberVector defines the methods that should be implemented by any
Object that is element of a real vector space of type N.
|
interface |
SparseNumberVector
Combines the SparseFeatureVector and NumberVector.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractNumberVector
AbstractNumberVector is an abstract implementation of FeatureVector.
|
class |
BitVector
Vector using a dense bit set encoding, based on
long[] storage. |
class |
ByteVector
Vector using
byte[] storage. |
class |
DoubleVector
Vector type using
double[] storage for real numbers. |
class |
FloatVector
Vector type using
float[] storage, thus needing approximately half as
much memory as DoubleVector . |
class |
HyperBoundingBox
HyperBoundingBox represents a hyperrectangle in the multidimensional space.
|
class |
IntegerVector
Vector type using
int[] storage. |
class |
ModifiableHyperBoundingBox
MBR class allowing modifications (as opposed to
HyperBoundingBox ). |
class |
OneDimensionalDoubleVector
Specialized class implementing a one-dimensional double vector without using
an array.
|
class |
ShortVector
Vector type using
short[] storage. |
class |
SparseByteVector
Sparse vector type, using
byte[] for storing the values, and
int[] for storing the indexes, approximately 5 bytes per non-zero
value (limited to -128..+127). |
class |
SparseDoubleVector
Sparse vector type, using
double[] for storing the values, and
int[] for storing the indexes, approximately 12 bytes per non-zero
value. |
class |
SparseFloatVector
Sparse vector type, using
float[] for storing the values, and
int[] for storing the indexes, approximately 8 bytes per non-zero
value. |
class |
SparseIntegerVector
Sparse vector type, using
int[] for storing the values, and
int[] for storing the indexes, approximately 8 bytes per non-zero
integer value. |
class |
SparseShortVector
Sparse vector type, using
short[] for storing the values, and
int[] for storing the indexes, approximately 6 bytes per non-zero
value. |
Modifier and Type | Method and Description |
---|---|
boolean |
ModifiableHyperBoundingBox.extend(SpatialComparable obj)
Extend the bounding box by some other spatial object.
|
static double |
VectorUtil.minCosAngle(SpatialComparable v1,
SpatialComparable v2)
Compute the minimum angle between two rectangles.
|
Constructor and Description |
---|
HyperBoundingBox(SpatialComparable other)
Constructor, cloning an existing spatial object.
|
ModifiableHyperBoundingBox(SpatialComparable hbb)
Derive a bounding box from a spatial object.
|
Modifier and Type | Class and Description |
---|---|
class |
Polygon
Class representing a simple polygon.
|
class |
PolygonsObject
Object representation consisting of (multiple) polygons.
|
Modifier and Type | Method and Description |
---|---|
static <E extends SpatialComparable,A> |
SpatialUtil.unionFlatMBR(A data,
ArrayAdapter<E,? super A> getter)
Compute the union of a number of objects as a flat MBR (low-level, for
index structures).
|
Modifier and Type | Method and Description |
---|---|
static int |
SpatialUtil.assertSameDimensionality(SpatialComparable box1,
SpatialComparable box2)
Check that two spatial objects have the same dimensionality.
|
static double[] |
SpatialUtil.centroid(SpatialComparable obj)
Returns the centroid of this SpatialComparable.
|
int |
SpatialSingleMinComparator.compare(SpatialComparable o1,
SpatialComparable o2) |
int |
SpatialSingleMeanComparator.compare(SpatialComparable o1,
SpatialComparable o2) |
int |
SpatialSingleMaxComparator.compare(SpatialComparable o1,
SpatialComparable o2) |
static boolean |
SpatialUtil.contains(SpatialComparable box,
double[] point)
Returns true if this SpatialComparable contains the given point, false
otherwise.
|
static boolean |
SpatialUtil.contains(SpatialComparable box1,
SpatialComparable box2)
Returns true if the first SpatialComparable contains the second
SpatialComparable, false otherwise.
|
static double |
SpatialUtil.enlargement(SpatialComparable exist,
SpatialComparable addit)
Compute the enlargement obtained by adding an object to an existing object.
|
static double |
SpatialUtil.enlargementScaled(SpatialComparable exist,
SpatialComparable addit,
double scale)
Compute the enlargement obtained by adding an object to an existing object.
|
static boolean |
SpatialUtil.equals(SpatialComparable box1,
SpatialComparable box2)
Test two SpatialComparables for equality.
|
static double[] |
SpatialUtil.getMax(SpatialComparable box)
Returns a clone of the maximum hyper point.
|
static double[] |
SpatialUtil.getMin(SpatialComparable box)
Returns a clone of the minimum hyper point.
|
static ModifiableHyperBoundingBox |
SpatialUtil.intersection(SpatialComparable box1,
SpatialComparable box2)
Calculate the intersection of the two MBRs or
null if they do
not intersect. |
static boolean |
SpatialUtil.intersects(SpatialComparable box1,
SpatialComparable box2)
Returns true if the two SpatialComparables intersect, false otherwise.
|
static double |
SpatialUtil.overlap(SpatialComparable box1,
SpatialComparable box2)
Computes the volume of the overlapping box between two SpatialComparables.
|
static double |
SpatialUtil.perimeter(SpatialComparable box)
Computes the perimeter of this SpatialComparable.
|
static double |
SpatialUtil.relativeOverlap(SpatialComparable box1,
SpatialComparable box2)
Computes the volume of the overlapping box between two SpatialComparables
and return the relation between the volume of the overlapping box and the
volume of both SpatialComparable.
|
static ModifiableHyperBoundingBox |
SpatialUtil.union(SpatialComparable box1,
SpatialComparable box2)
Computes the union HyperBoundingBox of two SpatialComparables.
|
static ModifiableHyperBoundingBox |
SpatialUtil.unionTolerant(SpatialComparable mbr1,
SpatialComparable mbr2)
Returns the union of the two specified MBRs.
|
static double |
SpatialUtil.volume(SpatialComparable box)
Computes the volume of this SpatialComparable.
|
static double |
SpatialUtil.volumeScaled(SpatialComparable box,
double scale)
Computes the volume of this SpatialComparable.
|
static double |
SpatialUtil.volumeUnion(SpatialComparable box1,
SpatialComparable box2)
Compute the volume (area) of the union of two MBRs.
|
static double |
SpatialUtil.volumeUnionScaled(SpatialComparable box1,
SpatialComparable box2,
double scale)
Compute the volume (area) of the union of two MBRs.
|
Modifier and Type | Field and Description |
---|---|
static SimpleTypeInformation<SpatialComparable> |
TypeUtil.SPATIAL_OBJECT
Spatial objects.
|
Modifier and Type | Interface and Description |
---|---|
interface |
DiscreteUncertainObject
Interface for discrete uncertain objects, that are represented by a finite
(possibly weighted) number of samples.
|
interface |
UncertainObject
Interface for uncertain objects.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractUncertainObject
Abstract base implementation for
UncertainObject s, providing shared
functionality such as bounding box access and random generation. |
class |
SimpleGaussianContinuousUncertainObject
Gaussian model for uncertain objects, sampled from a 3-sigma bounding box.
|
class |
UniformContinuousUncertainObject
Continuous uncertain object model using a uniform distribution on the
bounding box.
|
class |
UnweightedDiscreteUncertainObject
Unweighted implementation of discrete uncertain objects.
|
class |
WeightedDiscreteUncertainObject
Weighted version of discrete uncertain objects.
|
Modifier and Type | Field and Description |
---|---|
protected SpatialComparable |
AbstractUncertainObject.bounds
Bounding box of the object.
|
Constructor and Description |
---|
SimpleGaussianContinuousUncertainObject(SpatialComparable bounds)
Constructor.
|
UniformContinuousUncertainObject(SpatialComparable bounds)
Constructor.
|
Modifier and Type | Interface and Description |
---|---|
interface |
SpatialDistanceQuery<V extends SpatialComparable>
Query interface for spatial distance queries.
|
class |
SpatialPrimitiveDistanceQuery<V extends SpatialComparable>
Distance query for spatial distance functions
|
Modifier and Type | Method and Description |
---|---|
double |
SpatialPrimitiveDistanceQuery.minDist(SpatialComparable mbr,
DBID id) |
double |
SpatialDistanceQuery.minDist(SpatialComparable mbr,
DBID id)
Computes the minimum distance between the given MBR and the FeatureVector
object according to this distance function.
|
double |
SpatialPrimitiveDistanceQuery.minDist(SpatialComparable mbr,
V v) |
double |
SpatialDistanceQuery.minDist(SpatialComparable mbr,
V v)
Computes the minimum distance between the given MBR and the FeatureVector
object according to this distance function.
|
Modifier and Type | Method and Description |
---|---|
static <V extends SpatialComparable> |
RelationUtil.getColumnLabel(Relation<? extends V> rel,
int col)
Get the column name or produce a generic label "Column XY".
|
Modifier and Type | Method and Description |
---|---|
static int |
RelationUtil.dimensionality(Relation<? extends SpatialComparable> relation)
Get the dimensionality of a database relation.
|
Modifier and Type | Interface and Description |
---|---|
interface |
SpatialPrimitiveDistanceFunction<V extends SpatialComparable>
API for a spatial primitive distance function.
|
Modifier and Type | Method and Description |
---|---|
static int |
AbstractNumberVectorDistanceFunction.dimensionality(SpatialComparable o1,
SpatialComparable o2)
Get the common dimensionality of the two objects.
|
static int |
AbstractNumberVectorDistanceFunction.dimensionality(SpatialComparable o1,
SpatialComparable o2,
int expect)
Get the common dimensionality of the two objects.
|
double |
WeightedCanberraDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
SpatialPrimitiveDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2)
Computes the distance between the two given MBRs according to this distance
function.
|
double |
LorentzianDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
Kulczynski1DistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
CosineDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
ClarkDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
CanberraDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
BrayCurtisDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
ArcCosineDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
Modifier and Type | Method and Description |
---|---|
double |
HistogramIntersectionDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
Modifier and Type | Method and Description |
---|---|
double |
LngLatDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
LatLngDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
DimensionSelectingLatLngDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
Modifier and Type | Method and Description |
---|---|
double |
HistogramMatchDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
Modifier and Type | Method and Description |
---|---|
double |
EuclideanDistanceFunction.maxDist(SpatialComparable mbr1,
SpatialComparable mbr2)
Maximum distance of two objects.
|
double |
WeightedSquaredEuclideanDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
WeightedMaximumDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
WeightedManhattanDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
WeightedLPNormDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
WeightedEuclideanDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
SquaredEuclideanDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
MinimumDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
MaximumDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
ManhattanDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
LPNormDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
LPIntegerNormDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
EuclideanDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
private double |
WeightedMaximumDistanceFunction.preDistanceMBR(SpatialComparable mbr1,
SpatialComparable mbr2,
int start,
int end,
double agg) |
private double |
WeightedManhattanDistanceFunction.preDistanceMBR(SpatialComparable mbr1,
SpatialComparable mbr2,
int start,
int end,
double agg) |
private double |
WeightedLPNormDistanceFunction.preDistanceMBR(SpatialComparable mbr1,
SpatialComparable mbr2,
int start,
int end,
double agg) |
private double |
WeightedEuclideanDistanceFunction.preDistanceMBR(SpatialComparable mbr1,
SpatialComparable mbr2,
int start,
int end,
double agg) |
private double |
SquaredEuclideanDistanceFunction.preDistanceMBR(SpatialComparable mbr1,
SpatialComparable mbr2,
int start,
int end,
double agg) |
private double |
MaximumDistanceFunction.preDistanceMBR(SpatialComparable mbr1,
SpatialComparable mbr2,
int start,
int end,
double agg) |
private double |
ManhattanDistanceFunction.preDistanceMBR(SpatialComparable mbr1,
SpatialComparable mbr2,
int start,
int end,
double agg) |
private double |
LPNormDistanceFunction.preDistanceMBR(SpatialComparable mbr1,
SpatialComparable mbr2,
int start,
int end,
double agg)
Compute unscaled distance in a range of dimensions.
|
private double |
LPIntegerNormDistanceFunction.preDistanceMBR(SpatialComparable mbr1,
SpatialComparable mbr2,
int start,
int end,
double agg) |
private double |
EuclideanDistanceFunction.preDistanceMBR(SpatialComparable mbr1,
SpatialComparable mbr2,
int start,
int end,
double agg) |
private double |
WeightedMaximumDistanceFunction.preDistanceVM(NumberVector v,
SpatialComparable mbr,
int start,
int end,
double agg) |
private double |
WeightedManhattanDistanceFunction.preDistanceVM(NumberVector v,
SpatialComparable mbr,
int start,
int end,
double agg) |
private double |
WeightedLPNormDistanceFunction.preDistanceVM(NumberVector v,
SpatialComparable mbr,
int start,
int end,
double agg) |
private double |
WeightedEuclideanDistanceFunction.preDistanceVM(NumberVector v,
SpatialComparable mbr,
int start,
int end,
double agg) |
private double |
SquaredEuclideanDistanceFunction.preDistanceVM(NumberVector v,
SpatialComparable mbr,
int start,
int end,
double agg) |
private double |
MaximumDistanceFunction.preDistanceVM(NumberVector v,
SpatialComparable mbr,
int start,
int end,
double agg) |
private double |
ManhattanDistanceFunction.preDistanceVM(NumberVector v,
SpatialComparable mbr,
int start,
int end,
double agg) |
private double |
LPNormDistanceFunction.preDistanceVM(NumberVector v,
SpatialComparable mbr,
int start,
int end,
double agg)
Compute unscaled distance in a range of dimensions.
|
private double |
LPIntegerNormDistanceFunction.preDistanceVM(NumberVector v,
SpatialComparable mbr,
int start,
int end,
double agg) |
private double |
EuclideanDistanceFunction.preDistanceVM(NumberVector v,
SpatialComparable mbr,
int start,
int end,
double agg) |
private double |
WeightedMaximumDistanceFunction.preNormMBR(SpatialComparable mbr,
int start,
int end,
double agg) |
private double |
WeightedManhattanDistanceFunction.preNormMBR(SpatialComparable mbr,
int start,
int end,
double agg) |
private double |
WeightedLPNormDistanceFunction.preNormMBR(SpatialComparable mbr,
int start,
int end,
double agg) |
private double |
WeightedEuclideanDistanceFunction.preNormMBR(SpatialComparable mbr,
int start,
int end,
double agg) |
private double |
SquaredEuclideanDistanceFunction.preNormMBR(SpatialComparable mbr,
int start,
int end,
double agg) |
private double |
MaximumDistanceFunction.preNormMBR(SpatialComparable mbr,
int start,
int end,
double agg) |
private double |
ManhattanDistanceFunction.preNormMBR(SpatialComparable mbr,
int start,
int end,
double agg) |
private double |
LPNormDistanceFunction.preNormMBR(SpatialComparable mbr,
int start,
int end,
double agg)
Compute unscaled norm in a range of dimensions.
|
private double |
LPIntegerNormDistanceFunction.preNormMBR(SpatialComparable mbr,
int start,
int end,
double agg) |
private double |
EuclideanDistanceFunction.preNormMBR(SpatialComparable mbr,
int start,
int end,
double agg) |
Modifier and Type | Method and Description |
---|---|
double |
JensenShannonDivergenceDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
JeffreyDivergenceDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
ChiSquaredDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
Modifier and Type | Method and Description |
---|---|
double |
SubspaceMaximumDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
SubspaceManhattanDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
SubspaceLPNormDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
SubspaceEuclideanDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
double |
OnedimensionalDistanceFunction.minDist(SpatialComparable mbr1,
SpatialComparable mbr2) |
protected double |
SubspaceMaximumDistanceFunction.minDistObject(SpatialComparable mbr,
NumberVector v) |
protected double |
SubspaceManhattanDistanceFunction.minDistObject(SpatialComparable mbr,
NumberVector v) |
protected double |
SubspaceLPNormDistanceFunction.minDistObject(SpatialComparable mbr,
NumberVector v) |
protected double |
SubspaceEuclideanDistanceFunction.minDistObject(SpatialComparable mbr,
NumberVector v) |
Modifier and Type | Class and Description |
---|---|
class |
SpatialPair<K,V extends SpatialComparable>
Defines the requirements for objects that can be indexed by a Spatial Index,
which are spatial nodes or data objects.
|
Modifier and Type | Interface and Description |
---|---|
interface |
SpatialEntry
Defines the requirements for an entry in a node of a Spatial Index.
|
Modifier and Type | Class and Description |
---|---|
class |
SpatialDirectoryEntry
Represents an entry in a directory node of a spatial index.
|
class |
SpatialPair<K,V extends SpatialComparable>
Defines the requirements for objects that can be indexed by a Spatial Index,
which are spatial nodes or data objects.
|
class |
SpatialPointLeafEntry
Represents an entry in a leaf node of a spatial index.
|
Modifier and Type | Method and Description |
---|---|
boolean |
SpatialDirectoryEntry.extendMBR(SpatialComparable responsibleMBR)
Extend the MBR of this node.
|
Modifier and Type | Method and Description |
---|---|
boolean |
AbstractRStarTreeNode.adjustEntryIncremental(E entry,
SpatialComparable responsibleMBR)
Adjusts the parameters of the entry representing this node.
|
protected IndexTreePath<E> |
AbstractRStarTree.choosePath(IndexTreePath<E> subtree,
SpatialComparable mbr,
int depth,
int cur)
Chooses the best path of the specified subtree for insertion of the given
mbr at the specified level.
|
protected IndexTreePath<E> |
AbstractRStarTree.containedTest(IndexTreePath<E> subtree,
N node,
SpatialComparable mbr)
Test on whether or not any child of
node contains
mbr . |
protected IndexTreePath<E> |
AbstractRStarTree.findPathToObject(IndexTreePath<E> subtree,
SpatialComparable mbr,
DBIDRef id)
Returns the path to the leaf entry in the specified subtree that represents
the data object with the specified mbr and id.
|
Modifier and Type | Interface and Description |
---|---|
interface |
DeLiCluEntry
Defines the requirements for an entry in an DeLiClu-Tree node.
|
Modifier and Type | Class and Description |
---|---|
class |
DeLiCluDirectoryEntry
Defines the requirements for a directory entry in an DeLiClu-Tree node.
|
class |
DeLiCluLeafEntry
Defines the requirements for a leaf entry in an DeLiClu-Tree node.
|
Modifier and Type | Class and Description |
---|---|
class |
RStarTreeKNNQuery<O extends SpatialComparable>
Instance of a KNN query for a particular spatial index.
|
class |
RStarTreeRangeQuery<O extends SpatialComparable>
Instance of a range query for a particular spatial index.
|
Modifier and Type | Method and Description |
---|---|
static <O extends SpatialComparable> |
RStarTreeUtil.getKNNQuery(AbstractRStarTree<?,?,?> tree,
SpatialDistanceQuery<O> distanceQuery,
Object... hints)
Get an RTree knn query, using an optimized double implementation when
possible.
|
static <O extends SpatialComparable> |
RStarTreeUtil.getRangeQuery(AbstractRStarTree<?,?,?> tree,
SpatialDistanceQuery<O> distanceQuery,
Object... hints)
Get an RTree range query, using an optimized double implementation when
possible.
|
Modifier and Type | Interface and Description |
---|---|
(package private) interface |
RdKNNEntry
Defines the requirements for an entry in an RdKNN-Tree node.
|
Modifier and Type | Class and Description |
---|---|
class |
RdKNNDirectoryEntry
Represents an entry in a directory node of an RdKNN-Tree.
|
class |
RdKNNLeafEntry
Represents an entry in a leaf node of an RdKNN-Tree.
|
Modifier and Type | Method and Description |
---|---|
protected List<DoubleObjPair<RdKNNEntry>> |
RdKNNTree.getSortedEntries(AbstractRStarTreeNode<?,?> node,
SpatialComparable q,
SpatialPrimitiveDistanceFunction<?> distanceFunction)
Sorts the entries of the specified node according to their minimum distance
to the specified object.
|
Modifier and Type | Method and Description |
---|---|
<N extends SpatialComparable> |
MaxExtensionBulkSplit.partition(List<N> spatialObjects,
int minEntries,
int maxEntries)
Partitions the specified feature vectors where the split axes are the
dimensions with maximum extension.
|
<T extends SpatialComparable> |
SpatialSortBulkSplit.partition(List<T> spatialObjects,
int minEntries,
int maxEntries) |
<T extends SpatialComparable> |
SortTileRecursiveBulkSplit.partition(List<T> spatialObjects,
int minEntries,
int maxEntries) |
<T extends SpatialComparable> |
OneDimSortBulkSplit.partition(List<T> spatialObjects,
int minEntries,
int maxEntries) |
<T extends SpatialComparable> |
MaxExtensionSortTileRecursiveBulkSplit.partition(List<T> spatialObjects,
int minEntries,
int maxEntries) |
<T extends SpatialComparable> |
FileOrderBulkSplit.partition(List<T> spatialObjects,
int minEntries,
int maxEntries) |
<T extends SpatialComparable> |
BulkSplit.partition(List<T> spatialObjects,
int minEntries,
int maxEntries)
Partitions the specified feature vectors
|
<T extends SpatialComparable> |
AdaptiveSortTileRecursiveBulkSplit.partition(List<T> spatialObjects,
int minEntries,
int maxEntries) |
protected <T extends SpatialComparable> |
SortTileRecursiveBulkSplit.strPartition(List<T> objs,
int start,
int end,
int depth,
int dims,
int maxEntries,
SpatialSingleMeanComparator c,
List<List<T>> ret)
Recursively partition.
|
protected <T extends SpatialComparable> |
MaxExtensionSortTileRecursiveBulkSplit.strPartition(List<T> objs,
int start,
int end,
int depth,
int dims,
int maxEntries,
SpatialSingleMeanComparator c,
List<List<T>> ret)
Recursively partition.
|
protected <T extends SpatialComparable> |
AdaptiveSortTileRecursiveBulkSplit.strPartition(List<T> objs,
int start,
int end,
int depth,
int dims,
int maxEntries,
SpatialSingleMeanComparator c,
List<List<T>> ret)
Recursively partition.
|
Modifier and Type | Method and Description |
---|---|
private int |
MaxExtensionBulkSplit.chooseMaximalExtendedSplitAxis(List<? extends SpatialComparable> objects)
Computes and returns the best split axis.
|
Modifier and Type | Method and Description |
---|---|
<A> int |
LeastOverlapInsertionStrategy.choose(A options,
ArrayAdapter<? extends SpatialComparable,A> getter,
SpatialComparable obj,
int height,
int depth) |
<A> int |
LeastEnlargementWithAreaInsertionStrategy.choose(A options,
ArrayAdapter<? extends SpatialComparable,A> getter,
SpatialComparable obj,
int height,
int depth) |
<A> int |
LeastEnlargementInsertionStrategy.choose(A options,
ArrayAdapter<? extends SpatialComparable,A> getter,
SpatialComparable obj,
int height,
int depth) |
<A> int |
InsertionStrategy.choose(A options,
ArrayAdapter<? extends SpatialComparable,A> getter,
SpatialComparable obj,
int height,
int depth)
Choose insertion rectangle.
|
<A> int |
CombinedInsertionStrategy.choose(A options,
ArrayAdapter<? extends SpatialComparable,A> getter,
SpatialComparable obj,
int height,
int depth) |
<A> int |
ApproximativeLeastOverlapInsertionStrategy.choose(A options,
ArrayAdapter<? extends SpatialComparable,A> getter,
SpatialComparable obj,
int height,
int depth) |
Modifier and Type | Method and Description |
---|---|
<A> int |
LeastOverlapInsertionStrategy.choose(A options,
ArrayAdapter<? extends SpatialComparable,A> getter,
SpatialComparable obj,
int height,
int depth) |
<A> int |
LeastEnlargementWithAreaInsertionStrategy.choose(A options,
ArrayAdapter<? extends SpatialComparable,A> getter,
SpatialComparable obj,
int height,
int depth) |
<A> int |
LeastEnlargementInsertionStrategy.choose(A options,
ArrayAdapter<? extends SpatialComparable,A> getter,
SpatialComparable obj,
int height,
int depth) |
<A> int |
InsertionStrategy.choose(A options,
ArrayAdapter<? extends SpatialComparable,A> getter,
SpatialComparable obj,
int height,
int depth)
Choose insertion rectangle.
|
<A> int |
CombinedInsertionStrategy.choose(A options,
ArrayAdapter<? extends SpatialComparable,A> getter,
SpatialComparable obj,
int height,
int depth) |
<A> int |
ApproximativeLeastOverlapInsertionStrategy.choose(A options,
ArrayAdapter<? extends SpatialComparable,A> getter,
SpatialComparable obj,
int height,
int depth) |
Modifier and Type | Method and Description |
---|---|
<A> int[] |
ReinsertStrategy.computeReinserts(A entries,
ArrayAdapter<? extends SpatialComparable,? super A> getter,
SpatialComparable page)
Perform reinsertions.
|
<A> int[] |
FarReinsert.computeReinserts(A entries,
ArrayAdapter<? extends SpatialComparable,? super A> getter,
SpatialComparable page) |
<A> int[] |
CloseReinsert.computeReinserts(A entries,
ArrayAdapter<? extends SpatialComparable,? super A> getter,
SpatialComparable page) |
Modifier and Type | Method and Description |
---|---|
<A> int[] |
ReinsertStrategy.computeReinserts(A entries,
ArrayAdapter<? extends SpatialComparable,? super A> getter,
SpatialComparable page)
Perform reinsertions.
|
<A> int[] |
FarReinsert.computeReinserts(A entries,
ArrayAdapter<? extends SpatialComparable,? super A> getter,
SpatialComparable page) |
<A> int[] |
CloseReinsert.computeReinserts(A entries,
ArrayAdapter<? extends SpatialComparable,? super A> getter,
SpatialComparable page) |
Modifier and Type | Class and Description |
---|---|
private class |
TopologicalSplitter.Split<A,E extends SpatialComparable>
Internal data for an actual split.
|
Modifier and Type | Method and Description |
---|---|
protected <E extends SpatialComparable,A> |
AngTanLinearSplit.computeOverlap(A entries,
ArrayAdapter<E,A> getter,
long[] assign)
Compute overlap of assignment
|
<E extends SpatialComparable,A> |
TopologicalSplitter.split(A entries,
ArrayAdapter<E,A> getter,
int minEntries) |
<E extends SpatialComparable,A> |
SplitStrategy.split(A entries,
ArrayAdapter<E,A> getter,
int minEntries)
Split a page
|
<E extends SpatialComparable,A> |
RTreeQuadraticSplit.split(A entries,
ArrayAdapter<E,A> getter,
int minEntries) |
<E extends SpatialComparable,A> |
RTreeLinearSplit.split(A entries,
ArrayAdapter<E,A> getter,
int minEntries) |
<E extends SpatialComparable,A> |
GreeneSplit.split(A entries,
ArrayAdapter<E,A> getter,
int minEntries) |
<E extends SpatialComparable,A> |
AngTanLinearSplit.split(A entries,
ArrayAdapter<E,A> getter,
int minEntries) |
Modifier and Type | Class and Description |
---|---|
class |
Centroid
Class to compute the centroid of some data.
|
class |
ProjectedCentroid
Centroid only using a subset of dimensions.
|
class |
Vector
A mathematical vector object, along with mathematical operations.
|
Modifier and Type | Method and Description |
---|---|
static LinearScale[] |
Scales.calcScales(Relation<? extends SpatialComparable> db)
Compute a linear scale for each dimension.
|
Modifier and Type | Class and Description |
---|---|
private static class |
HilbertSpatialSorter.HilbertRef<T extends SpatialComparable>
Object used in spatial sorting, combining the spatial object and the object
ID.
|
Modifier and Type | Field and Description |
---|---|
protected T |
HilbertSpatialSorter.HilbertRef.vec
The referenced object.
|
Modifier and Type | Method and Description |
---|---|
private <T extends SpatialComparable> |
BinarySplitSpatialSorter.binarySplitSort(List<T> objs,
int start,
int end,
int depth,
int numdim,
int[] dims,
SpatialSingleMeanComparator comp)
Sort the array using a binary split in dimension curdim, then recurse with
the next dimension.
|
protected <T extends SpatialComparable> |
PeanoSpatialSorter.peanoSort(List<T> objs,
int start,
int end,
double[] mms,
int[] dims,
int depth,
long[] bits,
boolean desc)
Sort by Peano curve.
|
protected <T extends SpatialComparable> |
AbstractSpatialSorter.pivotizeList1D(List<T> objs,
int start,
int end,
int dim,
double threshold,
boolean desc)
"Pivotize" the list, such that all elements before the given position are
less than, all elements after the position are larger than the threshold
value in the given dimension.
|
<T extends SpatialComparable> |
SpatialSorter.sort(List<T> objs)
Partitions the specified feature vectors
|
<T extends SpatialComparable> |
AbstractSpatialSorter.sort(List<T> objs) |
<T extends SpatialComparable> |
ZCurveSpatialSorter.sort(List<T> objs,
int start,
int end,
double[] minmax,
int[] dims) |
<T extends SpatialComparable> |
SpatialSorter.sort(List<T> objs,
int start,
int end,
double[] minmax,
int[] dims)
Sort part of the list (start to end).
|
<T extends SpatialComparable> |
PeanoSpatialSorter.sort(List<T> objs,
int start,
int end,
double[] minmax,
int[] dims) |
<T extends SpatialComparable> |
HilbertSpatialSorter.sort(List<T> objs,
int start,
int end,
double[] minmax,
int[] dims) |
<T extends SpatialComparable> |
BinarySplitSpatialSorter.sort(List<T> objs,
int start,
int end,
double[] minmax,
int[] dims) |
protected <T extends SpatialComparable> |
ZCurveSpatialSorter.zSort(List<T> objs,
int start,
int end,
double[] mms,
int[] dims,
int depth)
The actual Z sorting function
|
Modifier and Type | Method and Description |
---|---|
static double[] |
AbstractSpatialSorter.computeMinMax(List<? extends SpatialComparable> objs)
Compute the minimum and maximum for each dimension.
|
private double |
AbstractSpatialSorter.getMinPlusMaxObject(List<? extends SpatialComparable> objs,
int s,
int dim)
Compute getMin(dim) + getMax(dim) for the spatial object.
|
Modifier and Type | Method and Description |
---|---|
static ScalesResult |
ResultUtil.getScalesResult(Relation<? extends SpatialComparable> rel)
Get (or create) a scales result for a relation.
|
Constructor and Description |
---|
ScalesResult(Relation<? extends SpatialComparable> relation)
Constructor.
|
Modifier and Type | Class and Description |
---|---|
class |
ParallelPlotProjector<V extends SpatialComparable>
ParallelPlotProjector is responsible for producing a parallel axes
visualization.
|
class |
ScatterPlotProjector<V extends SpatialComparable>
ScatterPlotProjector is responsible for producing a set of scatterplot
visualizations.
|
Modifier and Type | Method and Description |
---|---|
static Element |
SVGHyperCube.drawFilled(SVGPlot svgp,
String cls,
Projection2D proj,
SpatialComparable box)
Filled hypercube.
|
static Element |
SVGHyperCube.drawFrame(SVGPlot svgp,
Projection2D proj,
SpatialComparable box)
Wireframe hypercube.
|
private static ArrayList<double[]> |
SVGHyperCube.getVisibleEdges(Projection2D proj,
SpatialComparable box)
Get the visible (non-0) edges of a hypercube
|
Copyright © 2015 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.