Empty interface for nodes in the k-d tree.
This class is an implementation of a k-d tree as described in Friedman, Jerome H; Bentley, Jon Louis; Finkel, Raphael Ari: An Algorithm for Finding Best Matches in Logarithmic Expected Time; ACM Transactions on Mathematical Software; 1997, 3(3), pages 209-226 For creating a k-d tree use the
This class is some kind of factory for the
This class represents a nearest neighbour found during the search.
This class represents non-terminal nodes inside the k-d tree.
This class represents a terminal bucket in a k-d tree.
This class represents a terminal node inside a k-d tree.
KNIME GmbH, Konstanz, Germany
You may not modify, publish, transmit, transfer or sell, reproduce, create derivative works from, distribute, perform, display, or in any way exploit any of the content, in whole or in part, except as otherwise expressly permitted in writing by the copyright owner or as specified in the license file distributed with this product.