搜索资源列表
GEOMETRY.zip
- GEOMETRY is a collection of routines for geometric calculations in 2, 3 and N space. These calculations include angles, areas, containment, distances, intersection, nearest point, and volumes. The objects considered include points, lines, line segmen
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
最近邻法分类器演示
- 本程序是一个最近邻分类算法的演示程序，本程序完成了三种最近邻的演示并实现算法的分析-this procedure is a nearest neighbor classification algorithm the demo program, the completion of a three - Nearest Neighbor algorithm demonstration and analysis
计算几何算法
- 计算几何常用算法，包括点是否在多边型中，判定两条直线是否相交，平面最近点对-computational geometry algorithm commonly used, including whether a multilateral type in determining whether the intersection of two straight, the nearest point on Plane
KNN_Classi192133852005
- k-nearest neighbors classifier
matlog
- 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Sho
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
nearpiont
- 最接近点对问题是求二维坐标中的点对问题，该算法是为了将平面上点集S线性分割为大小大致相等的2个子集S1和S2，我们选取一垂直线l:x=m来作为分割直线。其中m为S中各点x坐标的中位数。由此将S分割为S1={p∈S|px≤m}和S2={p∈S|px>m}。从而使S1和S2分别位于直线l的左侧和右侧，且S=S1∪S2 。由于m是S中各点x坐标值的中位数，因此S1和S2中的点数大致相等。 递归地在S1和S2上解最接近点对问题，我们分别得到S1和S2中的最小距离δ1和δ2。现设δ=min(δ
dogcreating
- 数字正设影像的生成 由中心投影的航空图片生成 采用最邻近点重采样-figures are based images generated by the aviation center projection images generated using the nearest point Resampling
hhhh
- C语言用va_start等宏来处理这些可变参数。这些宏看起来很复杂,其实原理挺简单,就是根据参数入栈的特点从最靠近第...看了这几个宏,不禁让我再次感慨,C语言太灵活了-using C language, such as Acer va_start to deal with these variable parameters. These Acer looks very complicated, very simple principle, Push is on the basis of the
ann_1.1
- ANN is a library written in the C++ programming language to support both exact and approximate nearest neighbor searching in spaces of various dimensions.ANN is also a testbed containing programs and procedures for generating data sets, collect
xingwang4
- 电力系统静态最接近电压稳定极限的确定,电力系统静态最接近电压稳定极限的确定-closest static power system voltage stability limit setting, the nearest static power system voltage stability limits set
faceRegnize
- 人脸识别的matlab程序，先训练后测试，输入一副图像后将输出最接近的几副人脸。-procedures and training tests after an input image output for the nearest deputy Face.
Myknn
- knn，即k最近邻算法是模式识别中的一种比较简单而经典的分类算法-Knn, or k-nearest neighbor algrithom, is a simple and classical classifier algrithom.
GetNearestPoint
- Line intersect get the nearest point.
cagd_arithmetic
- 怒火之袍的贡献，有算法介绍如判断点是否在线段上、判断两线段是否相交、判断线段和直线是否相交、判断点是否在多边形中、判断线段是否在多边形内、计算点到线段的最近点、计算点到圆的最近距离及交点坐标、计算两条共线的线段的交点、求线段或直线与圆的交点、凸包的求法等等，图文并茂-Army's contribution to the gowns, as introduced algorithm to determine the point of whether online, to judge whe
classifier_knn
- 最近邻分类器（KNN）的C＋＋源码，适合模式识别、图像处理开发者用！-nearest neighbor classifier (KNN) of the C + + source code, suitable for pattern recognition, image processing developers use!
EXO2ET3
- K均值算法和K近邻算法，以及用MATLAB实现相关例子。-K-means algorithm and the K-nearest neighbor algorithm, and using MATLAB relevant examples.
EmbeddingDimension_FNN
- 假近邻法(False Nearest Neighbor, FNN)计算嵌入维的Matlab程序 文件夹说明： Main_FNN.m - 程序主函数，直接运行此文件即可 LorenzData.dll - 产生Lorenz时间序列 PhaSpaRecon.m - 相空间重构 fnn_luzhenbo.dll - 假近邻计算主函数 SearchNN.dll - 近邻点搜索 buffer_SearchNN_1.dll - 近邻点搜索缓存1 buffer_Search