KDTreeT Class

[SerializableAttribute]
public class KDTree<T> : KDTreeBase<KDTreeNode<T>>

<SerializableAttribute>
Public Class KDTree(Of T)
	Inherits KDTreeBase(Of KDTreeNode(Of T))

// This is the same example found in Wikipedia page on
// k-d trees: http://en.wikipedia.org/wiki/K-d_tree

// Suppose we have the following set of points:

double[][] points =
{
    new double[] { 2, 3 },
    new double[] { 5, 4 },
    new double[] { 9, 6 },
    new double[] { 4, 7 },
    new double[] { 8, 1 },
    new double[] { 7, 2 },
};


// To create a tree from a set of points, we use
KDTree<int> tree = KDTree.FromData<int>(points);

// Now we can manually navigate the tree
KDTreeNode<int> node = tree.Root.Left.Right;

// Or traverse it automatically
foreach (KDTreeNode<int> n in tree)
{
    double[] location = n.Position;
    Assert.AreEqual(2, location.Length);
}

// Given a query point, we can also query for other
// points which are near this point within a radius

double[] query = new double[] { 5, 3 };

// Locate all nearby points within an euclidean distance of 1.5
// (answer should be be a single point located at position (5,4))
KDTreeNodeCollection<int> result = tree.Nearest(query, radius: 1.5); 

// We can also use alternate distance functions
tree.Distance = Accord.Math.Distance.Manhattan;

// And also query for a fixed number of neighbor points
// (answer should be the points at (5,4), (7,2), (2,3))
KDTreeNodeCollection<int> neighbors = tree.Nearest(query, neighbors: 3);

' This is the same example found in Wikipedia page on
' k-d trees: http://en.wikipedia.org/wiki/K-d_tree

' Suppose we have the following set of points:

Dim points =
{
    New Double() { 2, 3 },
    New Double() { 5, 4 },
    New Double() { 9, 6 },
    New Double() { 4, 7 },
    New Double() { 8, 1 },
    New Double() { 7, 2 }
}

' To create a tree from a set of points, we use
Dim tree = KDTree.FromData(Of Integer)(points)

' Now we can manually navigate the tree
Dim node = tree.Root.Left.Right

' Or traverse it automatically
For Each n As KDTreeNode(Of Integer) In tree
    Dim location = n.Position
    Console.WriteLine(location.Length)
Next

' Given a query point, we can also query for other
' points which are near this point within a radius
'
Dim query = New Double() {5, 3}

' Locate all nearby points within an Euclidean distance of 1.5
' (answer should be a single point located at position (5,4))
'
Dim result = tree.Nearest(query, radius:=1.5)

' We can also use alternate distance functions
tree.Distance = Function(a, b) Accord.Math.Distance.Manhattan(a, b)

' And also query for a fixed number of neighbor points
' (answer should be the points at (5,4), (7,2), (2,3))
'
Dim neighbors = tree.Nearest(query, neighbors:=3)