kdtree1.2

代码说明：

  kd-tree 是广泛用来处理多维寻找最近点的数据结构。该文件中是由matlab调用c++代码实现的，其中实现包括kd-tree的建立最近点的查找等。(kd-tree is kind of data structure which is widely used to find the nearest point in multi-demensions.The zip file contain matlab and cpp files.The functions implemented include kd-tree building and nearest points searching and so on.)

文件列表：

kdtree
......\htm" target=_blank>CHANGES,1477,2008-12-09
......\fulltest.m,1311,2008-12-09
......\KDTree.h,23691,2008-12-09
......\kdtree_ball_query.cpp,5479,2008-12-09
......\kdtree_ball_query.m,1362,2008-12-09
......\kdtree_ball_query.mexmaci,44132,2008-12-09
......\kdtree_ball_query_demo.m,947,2008-12-09
......\kdtree_build.cpp,6130,2008-12-09
......\kdtree_build.m,850,2008-12-09
......\kdtree_build.mexmaci,48840,2008-12-09
......\kdtree_build_demo.m,574,2008-12-09
......\kdtree_delete.cpp,1747,2008-12-09
......\kdtree_delete.m,462,2008-12-09
......\kdtree_delete.mexmaci,39740,2008-12-09
......\kdtree_delete_demo.m,329,2008-12-09
......\kdtree_k_nearest_neighbors.cpp,5499,2008-12-09
......\kdtree_k_nearest_neighbors.m,1338,2008-12-09
......\kdtree_k_nearest_neighbors.mexmaci,53244,2008-12-09
......\kdtree_k_nearest_neighbors_demo.m,3569,2008-12-09
......\kdtree_k_nearest_neighbor_demo.m,590,2008-12-09
......\kdtree_nearest_neighbor.cpp,5533,2008-12-09
......\kdtree_nearest_neighbor.m,996,2008-12-09
......\kdtree_nearest_neighbor.mexmaci,48556,2008-12-09
......\kdtree_nearest_neighbor_demo.m,618,2008-12-09
......\kdtree_range_query.cpp,4229,2008-12-09
......\kdtree_range_query.m,974,2008-12-09
......\kdtree_range_query.mexmaci,44164,2008-12-09
......\kdtree_range_query_demo.m,653,2008-12-09
......\Makefile,5063,2008-12-09
......\MyHeaps.h,13341,2008-12-09
......\htm" target=_blank>README,2355,2008-12-09
......\TODO,159,2008-12-09
license.txt,1373,2009-05-22