搜索资源列表
bwdistsc
- This function computes Euclidean distance transform for 3D binary image with non-trivial aspect ratio (i.e. anisotropic pixels). The algorithm uses fast optimized line-scans and is actually faster than MATLAB s BWDIST implementation of search on opti
绘制用纹理填充的线条
- 本程序绘制用纹理填充的线条,一个很好的例子绝对值得收藏-texture mapping filled with the lines, a g#$#!88231#!#$noname.rar!#$#algorithm design curriculum in the Huffman tree search and mapping experiment
RTreeTemplate.zip
- R树，具有搜索，添加，删除节点能，利用R树，可以为空间搜索速度带来很大的提升，是GIS中必备的一种算法,R tree, with the search, add, delete nodes can use R trees, you can search for the space a great deal of speed upgrade is necessary for GIS in an algorithm
kdtree
- K-D树源码，不错的空间查找算法，在三维重建和匹配中应用较多！-KD tree source, good space search algorithm, in the three-dimensional reconstruction and matching the application of more!
sift-1.1.1_20071108_win
- Rob Hess的SIFT算法的C语言实现(基于OpenCV),金字塔采样和高斯差分提取特征点，K-D树寻找同名点，RANSAC去粗差-Rob Hess of the SIFT algorithm C language (based on OpenCV), sampling and Gaussian pyramid differential extraction of feature points, KD tree search for points of the same name, RANS
f.doc
- 题目1：图的建立与遍历；连通网的最小生成树生成实现。 内容： 1） 用邻接表表示方法建立图1所示图的存储结构，用邻接矩阵存表示方法建立图2所示网的存储结构。 2） 在图1 存储结构（邻接表）上实现深度优先搜索遍历和广度优先搜索遍历，并给出遍历结果（序列）。 3） 按照普里姆算法，在图2所示连通网的存储结构（邻接矩阵）上实现此网的最小生成树，并输出生成树。 -Title 1: Map of the establishment and ergodicity conne
Rstar_Berchtold.tar
- R*树，具有添加，删除，查询节点功能，是搜索算法中的一种，常用于GIS软件中。-R* tree, with add, delete, query node function, is a search algorithm, commonly used in the GIS software.
Pyramidtree.tar
- 金字塔树，具有添加，删除，查询节点功能，是搜索算法中的一种，常用于GIS软件中。-Pyramid tree, with add, delete, query node function, is a search algorithm, commonly used in the GIS software.
suffixtree
- this is an implement of suffix tree in java which is used as search in dectionary
kd_tree
- 一个高效的k-d tree实现，可以广泛的应用与图形图像处理。-K nearest neighbor search based on KD-tree
dtcwpt
- 2-band discrete wavelet transform (DWT) Dual-Tree Complex Wavelet Packet-The 2-band discrete wavelet transform (DWT) provides an octave-band analysis in the frequency domain, but this might not be ‘optimal’ for a given signal. The discrete wave
Search_matrix_based_on_the_adaptive_anti_collision
- 提出一种基于搜索矩阵的自适应防碰撞算法．该算法有效利用碰撞信息，通过构造搜索矩阵，克服自适应 二又树搜索算法逐位搜索效率低的缺点．同时提出碰撞堆栈的概念，根据时隙状态，来自适应调整搜索路径，从而 减少碰撞和空闲时隙数以及传输的比特量．理论和仿真实验表明，该算法有效实用，可有效减少识别时间，提高搜 索效率-Presents a matrix of adaptive search-based anti-collision algorithm. The algorithm is the e
dijkstra
- Dijkstra Algorithm - a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing.
brainee-30177
- An application that implement Uninformed search algorithms * Breadth-first search * Uniform-cost search * Depth-first search * Depth-limited search (tree and recursive versions) * Iterative deepening search-An application that im
BST
- this project is a Binary Search Tree project
kd-tree
- KD-Tree是一种由二叉搜索树推广而来的用于多维检索的树的结构形式-KD-Tree is a binary search tree by a promotion the tree is used to retrieve the multidimensional structure
binary-search-tree
- Binary search tree with the ability to remove - add - search - print
ab-tree
- (a,b) tree with finger search
wqnc
- 最优二分检索树的实现 Optimal binary search tree implementation-The realization of the Optimal binary search tree Optimal binary search tree implementation
706263
- 最优二分检索树的实现 Optimal binary search tree implementation-The realization of the Optimal binary search tree Optimal binary search tree implementation