搜索资源列表
RTree
- R-tree实现与理解，比较好，是图像检索中，高维索引必须工具-R-tree with the understanding, good image retrieval, high-dimensional indexing must tool
tree
- The function translates from labels of a binary tree to corresponding rows (R) and columns (C) of a 2 dimensional matrix storing the tree according to predefined convention, given below. The storing matrix preserves the fractal-like topolog
Coordinate
- 基于R树的K近邻查询算法及递增的k近邻查询算法实现-the implemention of R-tree K-nearest neighbor query algorithm and incremental nearest neighbor query algorithm
rtree
- R树空间索引，R树是在B树的基础上建立的。-R-tree spatial index, R tree is established on the basis of B-tree.
44187551RTree
- RTREER树 用C语言来实现的 ,学习R树的朋友们共同学习-RTREER tree, R tree using C language to achieve, learning R tree friends study together
RTree-C
- R树的基本操作代码，运用C语言来实现，算法精简。-The basic operation of the R-tree code, using C language to implement the algorithm streamlined.
RTreeTemplate
- This code is about R tree and its implementation in C-This code is about R tree and its implementation in C++
RTree
- 数据库领域大牛陶宇飞教授采用C++实现的R-tree, 包括Node及Entry的处理.-Distinguished Prof. Yufei Tao in database filed implemented the R-tree using using C++, including the processing of Nodes and Entrys.
the-two-binary-tree-coding
- 使用以下方案为二叉树编码： 空树编码为0 单结点树编码为1 所有m个结点的二叉树编码小于（m+1）个结点的二叉树的编号 若任何m个结点的二叉树，当左右子树为L和R个时的二叉树编号为n，则下列情况下所有m个结点的二叉树，其编号大于n： 左子树的编号大于L 左子树的编号为L，右子树的编号大于R 要求给定一个序数，输出一棵二叉树 -Use the following scheme is binary coded: empty tree coded 0 for singl
R_Tree
- 基于CUDA对R-Tree构建并行计算的加速源码-CUDA parallel computing to accelerate to construct R-Tree based on source code
IMAGERETRIEVAL
- 本程序使用颜色直方图提取图片特征值，再将图片特征建立R树进行图片检索。-The program uses color histogram extracted image characteristic value, then the image characteristics to establish R-tree image retri .
Rtree
- R树是GUTTMAN于1984年提出的最早支持有序扩展的对象存取方法之一，也是目前应用最为广泛的一种空间索引结构，该资料为其的应用。-R tree is one of GUTTMAN first proposed in 1984 to support an orderly expansion of the Object Access Method, is currently the most widely used of a spatial index structure for the app
SkRTree
- An R-Tree implementation. In short, it is a balanced n-ary tree containing a hierarchy of bounding rectangles.
boundingbox
- Bounding Box for R-tree in C-Bounding Box for R-tree in C++
ln_rtree
- 建立r树，使用c++完成，对于学习树的建立很有好处-create r-tree，use c++
rtree
- 学习r树和二叉树的必要经历，可以帮助我们学习理解树-study B-tree and r-tree
rtree1
- R树构建索引，包括R树的创建，插入，删除，查询操作 -R tree index, including the creation of the R tree, insert, delete, query operation
Topk-MSQ
- Top-k mutual skyline based on R-tr-Top-k mutual skyline based on R-tree
libspatialindex-master
- C++实现的R树，MVR树以及TPR树，提供C语言接口-C++ implementation of R*-tree, an MVR-tree and a TPR-tree with C API
spatialindex-JAVA
- JAVA实现的R树，提供高效的低维空间搜索性能-Java implemented R-tree，whose performance on low dimension spatial search is quite high