基于c的kd-tree实现方法.zip

上传者: Mactav | 上传时间: 2021-08-13 16:52:12 | 文件大小: 293KB | 文件类型: ZIP
kdtree(kd-树)的mex库,它允许最近邻域,k最近邻域,范围等查询 kd-tree的简约实现。该实现既可以通过MEX调用在MATLAB内部使用,也可以直接从C / C ++程序中作为独立工具使用。网站上的图像已使用“ fulltest.m”创建。 此实现提供以下功能: -kdtree_build:kd树构造O -kdtree_delete:释放由kdtree分配的内存 -kdtree_nearest_neighbor:最近的邻居查询(一个或多个点) -kdtree_k_nearest_neighbors:单个查询点的kNN -kdtree_range_query:矩形范围查询 -kdtree_ball_query:查询距离某点有距离增量的样本

文件下载

资源详情

[{"title":"( 67 个子文件 293KB ) 基于c的kd-tree实现方法.zip","children":[{"title":"基于C的kd-tree实现方法","children":[{"title":"toolbox","children":[{"title":"kdtree_nearest_neighbor_demo.m <span style='color:#111;'> 995B </span>","children":null,"spread":false},{"title":"kdtree_compile.m <span style='color:#111;'> 852B </span>","children":null,"spread":false},{"title":"kdtree_k_nearest_neighbors.m <span style='color:#111;'> 1.31KB </span>","children":null,"spread":false},{"title":"kdtree_ball_query.m <span style='color:#111;'> 1.33KB </span>","children":null,"spread":false},{"title":"kdtree_range_query_demo.m <span style='color:#111;'> 543B </span>","children":null,"spread":false},{"title":"kdtree_delete.mexw64 <span style='color:#111;'> 8.00KB </span>","children":null,"spread":false},{"title":"kdtree_build_demo.m <span style='color:#111;'> 755B </span>","children":null,"spread":false},{"title":"kdtree_delete.mexmaci64 <span style='color:#111;'> 44.01KB </span>","children":null,"spread":false},{"title":"kdtree_build.mexw64 <span style='color:#111;'> 35.50KB </span>","children":null,"spread":false},{"title":"MyHeaps.h <span style='color:#111;'> 13.03KB </span>","children":null,"spread":false},{"title":"kdtree_nearest_neighbor.cpp <span style='color:#111;'> 2.50KB </span>","children":null,"spread":false},{"title":"kdtree_build.m <span style='color:#111;'> 850B </span>","children":null,"spread":false},{"title":"kdtree_k_nearest_neighbors_demo.m <span style='color:#111;'> 3.49KB </span>","children":null,"spread":false},{"title":"kdtree_k_nearest_neighbors.mexmaci64 <span style='color:#111;'> 52.75KB </span>","children":null,"spread":false},{"title":"kdtree_figure_demo.m <span style='color:#111;'> 1.20KB </span>","children":null,"spread":false},{"title":"kdtree_delete.m <span style='color:#111;'> 462B </span>","children":null,"spread":false},{"title":"kdtree_range_query.m <span style='color:#111;'> 974B </span>","children":null,"spread":false},{"title":"kdtree_build.mexmaci64 <span style='color:#111;'> 48.80KB </span>","children":null,"spread":false},{"title":"kdtree_nearest_neighbor.mexw64 <span style='color:#111;'> 22.00KB </span>","children":null,"spread":false},{"title":"KDTree.m <span style='color:#111;'> 2.50KB </span>","children":null,"spread":false},{"title":"KDTree.h <span style='color:#111;'> 21.25KB </span>","children":null,"spread":false},{"title":"kdtree_io_from_mat.mexmaci64 <span style='color:#111;'> 52.79KB </span>","children":null,"spread":false},{"title":"README <span style='color:#111;'> 2.35KB </span>","children":null,"spread":false},{"title":"kdtree_k_nearest_neighbor_demo.m <span style='color:#111;'> 590B </span>","children":null,"spread":false},{"title":"kdtree_range_query.mexw64 <span style='color:#111;'> 12.50KB </span>","children":null,"spread":false},{"title":"KDTree_demo.m <span style='color:#111;'> 595B </span>","children":null,"spread":false},{"title":"kdtree_range_query.mexmaci64 <span style='color:#111;'> 48.55KB </span>","children":null,"spread":false},{"title":"kdtree_io_from_mat.mexw64 <span style='color:#111;'> 17.00KB </span>","children":null,"spread":false},{"title":"kdtree_delete.cpp <span style='color:#111;'> 360B </span>","children":null,"spread":false},{"title":"Makefile <span style='color:#111;'> 3.11KB </span>","children":null,"spread":false},{"title":"kdtree_ball_query.mexmaci64 <span style='color:#111;'> 48.46KB </span>","children":null,"spread":false},{"title":"kdtree_ball_query.cpp <span style='color:#111;'> 3.37KB </span>","children":null,"spread":false},{"title":"kdtree_nearest_neighbor.m <span style='color:#111;'> 1.21KB </span>","children":null,"spread":false},{"title":"kdtree_nearest_neighbor.mexmaci64 <span style='color:#111;'> 48.33KB </span>","children":null,"spread":false},{"title":"kdtree_ball_query_demo.m <span style='color:#111;'> 947B </span>","children":null,"spread":false},{"title":"kdtree_delete_demo.m <span style='color:#111;'> 329B </span>","children":null,"spread":false},{"title":"kdtree_io_to_mat.mexw64 <span style='color:#111;'> 9.00KB </span>","children":null,"spread":false},{"title":"kdtree_ball_query.mexw64 <span style='color:#111;'> 14.50KB </span>","children":null,"spread":false},{"title":"kdtree_io_from_mat.cpp <span style='color:#111;'> 2.00KB </span>","children":null,"spread":false},{"title":"kdtree_range_query.cpp <span style='color:#111;'> 4.14KB </span>","children":null,"spread":false},{"title":"kdtree_io_to_mat.mexmaci64 <span style='color:#111;'> 44.35KB </span>","children":null,"spread":false},{"title":"kdtree_io_to_mat.cpp <span style='color:#111;'> 1.63KB </span>","children":null,"spread":false},{"title":"kdtree_k_nearest_neighbors.cpp <span style='color:#111;'> 5.38KB </span>","children":null,"spread":false},{"title":"kdtree_build.cpp <span style='color:#111;'> 1.90KB </span>","children":null,"spread":false},{"title":"kdtree_k_nearest_neighbors.mexw64 <span style='color:#111;'> 22.50KB </span>","children":null,"spread":false}],"spread":false},{"title":"kdtree-matlab.creator <span style='color:#111;'> 10B </span>","children":null,"spread":false},{"title":"extensions","children":[{"title":"kdtree_load.cpp <span style='color:#111;'> 712B </span>","children":null,"spread":false},{"title":"kdtree_load.m <span style='color:#111;'> 485B </span>","children":null,"spread":false},{"title":"kdtree_save.m <span style='color:#111;'> 407B </span>","children":null,"spread":false},{"title":"KDTree.h <span style='color:#111;'> 27.37KB </span>","children":null,"spread":false},{"title":"kdtree_print.m <span style='color:#111;'> 306B </span>","children":null,"spread":false},{"title":"kdtree_save.cpp <span style='color:#111;'> 1.45KB </span>","children":null,"spread":false},{"title":"kdtree_print.cpp <span style='color:#111;'> 1.27KB </span>","children":null,"spread":false}],"spread":true},{"title":"media","children":[{"title":"teaser.png <span style='color:#111;'> 27.30KB </span>","children":null,"spread":false}],"spread":true},{"title":"kdtree-matlab.includes <span style='color:#111;'> 78B </span>","children":null,"spread":false},{"title":"cppdemos","children":[{"title":"kdtree_nearest_neighbor.cpp <span style='color:#111;'> 3.05KB </span>","children":null,"spread":false},{"title":"old.h <span style='color:#111;'> 3.07KB </span>","children":null,"spread":false},{"title":"kdtree_delete.cpp <span style='color:#111;'> 714B </span>","children":null,"spread":false},{"title":"Makefile <span style='color:#111;'> 3.50KB </span>","children":null,"spread":false},{"title":"kdtree_ball_query.cpp <span style='color:#111;'> 1.90KB </span>","children":null,"spread":false},{"title":"kdtree_range_query.cpp <span style='color:#111;'> 2.18KB </span>","children":null,"spread":false},{"title":"kdtree_k_nearest_neighbors.cpp <span style='color:#111;'> 2.43KB </span>","children":null,"spread":false},{"title":"kdtree_build.cpp <span style='color:#111;'> 4.39KB </span>","children":null,"spread":false}],"spread":true},{"title":".gitignore <span style='color:#111;'> 24B </span>","children":null,"spread":false},{"title":"README.md <span style='color:#111;'> 2.32KB </span>","children":null,"spread":false},{"title":"kdtree-matlab.config <span style='color:#111;'> 31B </span>","children":null,"spread":false},{"title":"kdtree-matlab.files <span style='color:#111;'> 742B </span>","children":null,"spread":false}],"spread":true}],"spread":true}]

评论信息

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明