/// <summary> /// Creates a new k-dimensional tree from the given points. /// </summary> /// /// <typeparam name="T">The type of the value to be stored.</typeparam> /// /// <param name="points">The points to be added to the tree.</param> /// <param name="distance">The distance function to use.</param> /// /// <returns>A <see cref="KDTree{T}"/> populated with the given data points.</returns> /// public static KDTree <T> FromData <T>(double[][] points, Func <double[], double[], double> distance) { return(KDTree <T> .FromData(points, distance)); }
public KDTreeTraversal(KDTree <T> tree, KDTreeTraversalMethod <T> method) { this.tree = tree; this.method = method; }
/// <summary> /// Creates a new k-dimensional tree from the given points. /// </summary> /// /// <typeparam name="T">The type of the value to be stored.</typeparam> /// /// <param name="points">The points to be added to the tree.</param> /// <param name="values">The corresponding values at each data point.</param> /// /// <returns>A <see cref="KDTree{T}"/> populated with the given data points.</returns> /// public static KDTree <T> FromData <T>(double[][] points, T[] values) { return(KDTree <T> .FromData(points, values)); }