public class MidPointOfWidestDimension extends KDTreeNodeSplitter implements TechnicalInformationHandler
@techreport{Moore1991,
author = {Andrew Moore},
booktitle = {University of Cambridge Computer Laboratory Technical Report No. 209},
howpublished = {Extract from PhD Thesis},
title = {A tutorial on kd-trees},
year = {1991},
HTTP = {http://www.autonlab.org/autonweb/14665.html}
}
MAX, MIN, WIDTH| Constructor and Description |
|---|
MidPointOfWidestDimension() |
| Modifier and Type | Method and Description |
|---|---|
java.lang.String |
getRevision()
Returns the revision string.
|
TechnicalInformation |
getTechnicalInformation()
Returns an instance of a TechnicalInformation object, containing detailed
information about the technical background of this class, e.g., paper
reference or book this class is based on.
|
java.lang.String |
globalInfo()
Returns a string describing this nearest neighbour search algorithm.
|
void |
splitNode(KDTreeNode node,
int numNodesCreated,
double[][] nodeRanges,
double[][] universe)
Splits a node into two based on the midpoint value of the dimension
in which the points have the widest spread.
|
getOptions, listOptions, setEuclideanDistanceFunction, setInstanceList, setInstances, setNodeWidthNormalization, setOptionsequals, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitmakeCopypublic java.lang.String globalInfo()
public TechnicalInformation getTechnicalInformation()
getTechnicalInformation in interface TechnicalInformationHandlerpublic void splitNode(KDTreeNode node, int numNodesCreated, double[][] nodeRanges, double[][] universe) throws java.lang.Exception
splitNode in class KDTreeNodeSplitternode - The node to split.numNodesCreated - The number of nodes that so far have been
created for the tree, so that the newly created nodes are
assigned correct/meaningful node numbers/ids.nodeRanges - The attributes' range for the points inside
the node that is to be split.universe - The attributes' range for the whole
point-space.java.lang.Exception - If there is some problem in splitting the
given node.public java.lang.String getRevision()
getRevision in interface RevisionHandlergetRevision in class KDTreeNodeSplitter