搜索资源列表
HnSRTree-2.0beta5a
- SR-tree is an index structure for high-dimensional nearest neighbor queries，C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image / video a
spatialindex.vc
- 多维索引的多个结构的常用算法，如R树的插入删除修改，又如四叉树的插入删除修改等-Index multidimensional structure of a number of commonly used algorithms, such as the R-tree insert delete changes Again quadtree insert the revisions delete
rstree
- 基于内容的多媒体数据库检索算法： 用于最近邻搜索的R*-tree算法-content-based multimedia database search algorithm : Nearest Neighbor Search for the R *- tree algorithm
srtree
- 基于内容的多媒体数据检索算法SR-Tree，类似于R*-tree和SS-tree的最近邻搜索 -content-based multimedia data retrieval algorithm SR-Tree, similar to the R *- tree and SS-tree search of the nearest neighbor
Rplus.tar
- R+树的c实现源码，对应文章T. K. Sellis, N. Roussopoulos, C. Faloutsos: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects.-R tree c achieve source code, corresponding article T. K. Sellis, N. Roussopoulos, C. Faloutsos : The R-Tree : A Dynamic Index for
R Tree 多维数据
- R树是一种用于处理多维数据的数据结构，用来访问二维或者更高维区域对象组成的空间数据.R树是一棵平衡树
rtree-core-lib
- r-tree及其变形的库，对于开发gis的人员很有帮助-r-tree and the deformation of the Treasury, for the development of the staff very helpful gis
tree
- 假设以如下说明的三元组 (F、C、L/R) 序列输入一棵二叉树的诸边(其中 F 表示双亲结点的标识，C 表示孩子结点标识，L/R 表示 C 为 F 的左孩子或右孩子)，且在输入的三元组序列中，C 是按层次顺序出现的。设结点的标识是字符类型。F=‘＾’时 C 为根结点标识，若 C 亦为‘＾’，则表示输入结束。 试编写算法，由输入的三元组序列建立二叉树的二叉链表,并以中序序列输出。 ^AL ABL ACR BDL CEL CFR DGR FHL ^^L -Assuming the fo
MyRTree
- implementation of r-tr-implementation of r-tree
Tree
- 1.16② 试写一算法，如果三个整数X，Y和Z 的值不是依次非递增的，则通过交换，令其为 非递增。 -Status Dencendant(Array1D L,Array1D R,int n,int u,int v) /* If node u is the dencendant of node v ,*/ /* then return TRUE else return FALSE . */ /* L[i] is the left child of the
chenlin
- 以二叉链表作为存储结构 由用户输入一棵二叉树 使用菜单界面 分别输出二叉树的先序、中序和后序遍历下的结点访问次序 输出二叉树的深度 输出二叉树中所有的叶子结点及其数目。-Linked list to binary storage structure from user input as a binary tree binary tree using the menu interface, the output of the first order, respectively,
RTreeTemplate
- R树模板，可以用来解决一些数据结构方面的东西-R tree templates can be used to solve some of the data structure of things. . .
RTree
- R树索引程序，基于C语言，是学习空间索引很好的提高资料-R-tree index procedure, based on the C language, is to learn good spatial index to improve data
rtree(zyw)
- 一种R树结构的实现，可实现R树索引等功能-A realization of R tree, R-tree index can be achieved and other functions
rtree
- 空间索引树R-tree使用C语言实现，希望对大家有用-R-tree spatial index tree using the C language, we hope to be useful
tree
- 算法中二叉树的实现，包括建立查找，实现二叉排序树，能解决二叉书大量问题-源语言： 中文 允许输入拉丁字符的拼音 请键入文字或网站地址，或者上传文档。 取消 Suànfǎ zhōng èr chā shù de shíxiàn, bāokuò jiànlì cházhǎo, shíxiàn èr chā páixù shù, néng jiějué èr chā shū dàliàng wèntí 将中文译成英语 中文(简体) 英语 日语 Binary tree
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
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
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