搜索资源列表
最近点对问题，分别用蛮力法和分治法进行了求解
- 最近点对问题，分别用蛮力法和分治法进行了求解，算法已经做过优化-Nearest point on the issue, respectively, and with brute force method for solving divide and conquer algorithm optimization has been done
nearestPointPair
- 给定一个点数组，比较求解最近点对的一般算法和分治法的效率。-Given a point group, compared to solve the nearest point on the general algorithm and divide and conquer efficiency.
ClosetPairs
- 本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the probl
Divfuntion
- 算法分析实验 算法分析分治法 最近点对问题-Experimental analysis of algorithms analysis of algorithms divide and conquer the nearest point of the problem
zuijingdiandui
- 基于MFC单文档实现的最近点对的算法，是图形界面的-MFC single document based on the closest point to the realization of the algorithm is a graphical interface
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.
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
ClosestPairOfPoints
- 本文实现了平面内NlogN时间内，查找最近点对的算法，欢迎大家下载-This implements the plane NlogN time, find the nearest point of the algorithm, are welcome to download
mincouplepoints
- 算法导论作业，求最近点对，vs2005，c++开发，复杂度o（nlogn）有图形交互界面，可以用鼠标设置点，也可以随机生成点，最多支持100万个点-Introduction to Algorithms job, find nearest points, vs2005, c++ development, complexity o (nlogn) with a graphical interface, you can set point with the mouse can also be rand
close_pair
- 算法:求最近点对的实现。在vs2010上运行通过！-Algorithm: Find the nearest point on the realization. In vs2010 run through!
closetpair
- 最近点对问题 代码 《算法设计技巧与分析》中的最近点对问题代码实现-Closest point code " algorithm design techniques and analysis," the closest point code
DivideConquer
- 一个实现平台最近点对问题的算法作业代码。-An implementation platform closest point algorithm for the job code.
include
- (1) 随机算法能求解的问题类型和实例。 (2) 求解最近点对问题的方法。 (3) 目前求解最近点对问题的常用算法中，最快的算法时间复杂度是多少 -(1) the problem types and instances can be solved by the random algorithm. (2) the method of solving the problem of the nearest point. (3) at present, the time compl
CPPT
- 给定一个平面，内有n个点，找出其中距离最近的两个点。采用图形界面，n的个数大于100，随机生成点。 采用QT Creator生成坐标轴界面 分而治之算法计算最近点对。-Given a plane, there are n points, find out where the nearest two points. Use graphical interface, the number n is greater than 100, randomly generated points. QT Cre
algorithm_project2
- 这是求在一堆点中，找出最短距离的两个点对的算法问题。(Point pair problem with the shortest distance.)
ClosestPair
- 求解平面最近点对，分治经典题目。。。。。。。(The program to solve the nearest point pair of the plane, divide and conquer the classic topic.)
迭代最近点算法综述
- 三维点集配准问题是计算机技术中的一个极其重要的问题，作为解决三维点集配准问题的一个应用较为广泛的算法，ICP算法得到了研究者的关注，本文以一种全新的思路从配准元素的选择、配准策略的确定和误差函数的求解等3个方面对三维点集配准的ICP算法的各种改进和优化进行了分类和总结。(The three-dimensional point set registration problem is an extremely important issue in computer technology. As an
平面内最近点对
- 分治算法练习，使用分治算法实现计算平面内最近点对距离。子问题将平面划分为左右两部分分开计算最短距离，再在中间条带中找是否有更近点对。(Divide and conquer algorithm to calculate the closest point pair in the plane)