Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - viskdtree
Search - viskdtree - List
kd树源代码,代码简单易懂,很使用。大家可以下载试试看,希望对您有所帮助
Update : 2008-10-13 Size : 246.59kb Publisher : liuyanfeng11

kdtree. 用于最近点搜索。 可输入点的三维坐标,再输入查询点,即可得到指定的最近点坐标。
Update : 2008-10-13 Size : 251.68kb Publisher : 卢新

kd树源代码,代码简单易懂,很使用。大家可以下载试试看,希望对您有所帮助-kd tree source code, code easy-to-read, it is used. Everyone can download to try, I hope for your help
Update : 2025-02-17 Size : 464kb Publisher : liuyanfeng11

kdtree. 用于最近点搜索。 可输入点的三维坐标,再输入查询点,即可得到指定的最近点坐标。-kdtree. english for nearest point. Can input three-dimensional coordinates, and then enter a query point can be specified by coordinates of the nearest point.
Update : 2025-02-17 Size : 465kb Publisher : 卢新

k-d树搜索代码,k-d树在碰撞检测的建模中应用非常广泛-k-d tree
Update : 2025-02-17 Size : 576kb Publisher : 任静

KD树的程序,实现从2维到k维的数据检索。kd树(k维搜索树)是把二叉树搜索树推广到多维数据的一种主存数据结构。kd树是一个二叉树,他的内部节点由一个相关联的属性a和一个值v,它将数据点分成两个部分:a值小于v的部分和a值大于等于v的部分。由于所有的维的属性在层间循环,所以树在不同层上的属性是不同的。-KD tree program, from a 2-D to k-dimensional data retrieval. kd Tree (k-dimensional search tree) is to be extended to multidimensional binary search tree data structure of a main memory data. kd tree is a binary tree, whose internal nodes are associated by an attribute a and a value v, the data points will be divided into two parts: a part is less than v and v a value greater than or equal parts. Since all the properties in layer-dimensional cycle, so the trees on the property in the different layers are different.
Update : 2025-02-17 Size : 802kb Publisher : 曾真

kd-tree数据结构的C语言实现,代码中有注释,可读性强,适合初学者使用。-kd-tree data structure of the C language, there are notes, readable.
Update : 2025-02-17 Size : 2.48mb Publisher : tim

DL : 0
根据一片点云经过旋转变换,生成另一片点云,求出曲率,实现两片点云的粗配准。-Through the rotation transform a point cloud generated another piece of point cloud obtained curvature coarse registration of two point clouds.
Update : 2025-02-17 Size : 1.51mb Publisher : gaochao
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.