Description: Kd-trees are data structures which are used to store points in k-dimensional space. As it follows its name, kd-tree is a tree. Tree leafs store points of the dataset (one or several points in each leaf). Each point is stored in one and only one leaf, each leaf stores at least one point.
To Search:
File list (Check if you may need any files):
kdtree\CHANGES
......\KDTree.h
......\Makefile
......\MyHeaps.h
......\README
......\TODO
......\fulltest.m
......\kdtree_ball_query.cpp
......\kdtree_ball_query.m
......\kdtree_ball_query.mexmaci
......\kdtree_ball_query_demo.m
......\kdtree_build.cpp
......\kdtree_build.m
......\kdtree_build.mexmaci
......\kdtree_build_demo.m
......\kdtree_delete.cpp
......\kdtree_delete.m
......\kdtree_delete.mexmaci
......\kdtree_delete_demo.m
......\kdtree_k_nearest_neighbor_demo.m
......\kdtree_k_nearest_neighbors.cpp
......\kdtree_k_nearest_neighbors.m
......\kdtree_k_nearest_neighbors.mexmaci
......\kdtree_k_nearest_neighbors_demo.m
......\kdtree_nearest_neighbor.cpp
......\kdtree_nearest_neighbor.m
......\kdtree_nearest_neighbor.mexmaci
......\kdtree_nearest_neighbor_demo.m
......\kdtree_range_query.cpp
......\kdtree_range_query.m
......\kdtree_range_query.mexmaci
......\kdtree_range_query_demo.m
license.txt
Download