搜索资源列表
shortestpath
- 用蛮力法和分治法求最近点对的问题-用蛮力法和分治法求最近点对的问题............
PointPair
- 根据分治算法实现求平面上最近点对的复杂度为(nlgn)的算法 有图形界面,能通过鼠标输入点-Under sub-rule algorithm seeking the nearest point on the plane of the complexity of (nlgn) algorithm for graphical interface, through mouse input points
nearestpoint
- 使用vc++解决平面上最近点的求解问题,使用的是递归算法,时间复杂度较高-Using vc++ to solve the nearest point on the plane to solve the problem, using a recursive algorithm, time complexity of a high
zuijingdiandui
- 基于MFC单文档实现的最近点对的算法,是图形界面的-MFC single document based on the closest point to the realization of the algorithm is a graphical interface
Nearest_neighbours_and_kD_trees
- 利用kd树寻找多维空间最近点的英文书籍,有利于学习ICP算法!-Multidimensional space using kd tree to find the nearest point of the English books is conducive to learning ICP algorithm!
NearestPoint
- 最近点对问题是许多算法书籍必有得一个要探讨的问题,本人基于王晓军的《算法设计与分析》实现了分治法及传统法的图形化演示程序,大家可以看到两者的算法性能的比较。-The nearest point of the problem is that many books there must be a method to explore the question, I based Wang Xiaojun' s " Algorithm Design and Analysis of"
nearestneighbor
- 用C编写的一个求最近点对的算法,不是很实用,但是对刚开始学习算法的人可能会有点帮助-C code .i wish this can do a little help to your study.
cloestPair
- 最近点对程序,java实现。可以计算平面内的最近点对-The nearest point on the program, java implementation. Can calculate the closest point on plane
suanfa
- 请选择操作: 1. 最近点对 2. 假币问题 3. 堆排序 4. 全源最短路径-Please choose: 1. Nearest points on 2. Counterfeiting problem 3. Heap sort 4. All source shortest path
zuijindianduierwei
- 算法 最近点对问题 二维的解决 很简单 值得-Closest point algorithm to solve the problem is very simple two-dimensional worth a look
zuijindianduiyiwei
- 算法 最近点对 一维问题解决 可以下载下来研究下-Closest point algorithm to solve one-dimensional problem under study can be downloaded
pairdistance
- 在C语言环境下,实现寻找空间中最近点对的有效算法。-In the C language environment, to achieve search space, the nearest point on the efficient algorithm.
kdtree1.2
- kd-tree 是广泛用来处理多维寻找最近点的数据结构。该文件中是由matlab调用c++代码实现的,其中实现包括kd-tree的建立最近点的查找等。-kd-tree is kind of data structure which is widely used to find the nearest point in multi-demensions.The zip file contain matlab and cpp files.The functions implemented inclu
kdtree_in_matlab
- kd-tree 是一种常用的数据结构,它在搜索最近点中有普遍用处。该文件是一个用纯matlab写成的源代码。-kd-tree is a commonly used data structure, it is commonly used in searches for the nearest point. The file is a pure source code written in matlab.
fenzhifa
- 用c++实现分治法算法的最近点对问题(在VS2008平台上)-Using c++ implementation of divide and conquer algorithm for the nearest point of the problem (in VS2008 platform)
searchnearestnode
- 程序实现给定平面上N个点的坐标,找出距离最近的两个点.程序中是两种方法寻找最近点对。解法一的时间复杂度是O(N^2)解法二的时间复杂度是(N*lg2/lgN)第二种方法较第一种方法在一维情况下,时间复杂度改进了不少。但是这个方法不能推广到二维的情况,因为距离最近的点对不能保证是影射到某条直线之后紧靠着的两个点。-the procedure can realize the Coordinate which have N nodes ,find the nearest distance betwee
newsearchthenearestnode
- 程序实现给定平面上N个点的坐标,找出距离最近的两个点.程序中是两种方法寻找最近点对。解法一的时间复杂度是O(N^2)解法二的时间复杂度是(N*lg2/lgN)第二种方法较第一种方法在一维情况下,时间复杂度改进了不少。但是这个方法不能推广到二维的情况,因为距离最近的点对不能保证是影射到某条直线之后紧靠着的两个点。-the procedure can realize the Coordinate which have N nodes ,find the nearest distance betwee
Thenearestpointofthealgorithm
- 最近点对的算法实现,希望大家互相学习,提建议。希望对您有帮助-The nearest point of the algorithm, I hope you learn from each other suggestions. I hope for your help
ClosestPairOfPoints
- 本文实现了平面内NlogN时间内,查找最近点对的算法,欢迎大家下载-This implements the plane NlogN time, find the nearest point of the algorithm, are welcome to download
MinDistance_PointPair
- 用java实现的平面上最近点对的查找,包括蛮力法和分治法的实现。-Java implementation of the plane with the nearest point on the search, including the brute force method and the divide and conquer implementation.