搜索资源列表
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.
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 w
zuijindianwenti
- 这是我自己写的一个归并排序实现的最近点对问题的算法实现 -This is what I had written a merge sort to achieve the nearest point algorithm for the problem ~ ~
closestPairPoints
- 使用分治法求大量点中的最近点对.使用MFC做用户界面.10^6个点时间大约为0.1妙-Get the closest pair of points from points clouds by divide and conquer method. UI by MFC. It costs about 0.1 second computing from 1,000,000 points
Fib
- 算法分析基础——Fibonacci序列问题 分治法在数值问题中的应用——最近点对问题 减治法在组合问题中的应用——8枚硬币问题 变治法在排序问题中的应用——堆排序问题-The basis of algorithm analysis- Fibonacci sequence divide and conquer the problem of the numerical problems- the nearest point on
closed_point
- 最近点对的算法： 对给定数量的点，求其中点对的最短距离。（测试样本为1000,5000个点，跑出来的时间均为0（s））详细思路请看程序注释。-The nearest point of the algorithm: for a given number of points, find the point where the shortest distance. (1000,5000 the test sample points, r
ClosestPair
- 二维最近点对算法，分别用遍历方法和分治算法实现，并对实现的时间进行比较-Two-dimensional nearest point of the algorithm, respectively, and partition with traversal algorithm, and compare the time to achieve
NearestPoint
- 算法分析与设计经典问题，用分治法求最近点对，并与蛮力法做对比-Classical algorithm analysis and design problems with the divide and conquer method for the last point, and compared with the brute force method to do
ClosestPoints
- 暴力法和递归法求解最近点对问题（带图形界面）-Violence Act and the nearest point of a recursive method for solving the problem (with GUI)
Apoint
- 一维最近点对问题 通过输入一维点x的坐标，求得距离最近的点对和距离-One-dimensional nearest point of the problem by entering the coordinates of one-dimensional point x, obtained from the nearest point and distance
closed-points
- 二维最近点对递归算法，最大点对为10000对-Two-dimensional nearest point of the recursive algorithm, the maximum point of the 10,000 pairs
Closest-Pair-Point
- 寻找最近点对(... ... ... ... ... ... ...)-find closest path pair (.....................................)
NearestDouProble
- 最近点对问题，分别用蛮力法和分治法进行了求解，算法已经做过优化-Nearest point on the issue, respectively, and with brute force method for solving divide and conquer algorithm optimization has been done
closetpair
- 最近点算法,求若干个点之间的最近点对间的距离，给出横纵坐标!-Nearest point algorithm, find the number of points between the nearest point of the distance between the vertical and horizontal coordinates are given!
NearestPoint
- 使用分治法实现最近点对算法，图形化界面，可以通过鼠标点击生成点也可以随机生成，并计算得到最近点对-Divide and conquer method to achieve the closest point algorithm, graphical interface, can be generated by a mouse click can also be randomly generated, and calculated to
Ask-the-nearest-point
- 求最近点对点算法，关于如何求解最近的点对点问题的算法-Ask the nearest point of the algorithmAsk the nearest point of the algorithm
lab22
- 首先，定义两个对象一个定义了点的x,y坐标和它的标号，另一个对象是两点之间的距离。然后用冒泡比较法对点的x,y坐标分别进行排序，编写控制台程序，输入点的个数，分为两种方法求最近点对。根据点的个数分为3个点的情形和大于3个点的情形，3个点的直接对两两点之间的距离进行比较。大于3点的用分治递归法求解，通过划定界限分8块没一点只对其他7块内的点进行比较长度最后求出最短距离。-First of all, define two object a
point
- 最近点对问题，采用分治法，编译通过，代码正确-Nearest point problem using the divide-and-conquer method, the compiler through correct code
divide1
- 最近点对问题：分治法解决 时间复杂度：O(nlogn)-the closest point problem "divide and conquer" time complexity:O(nlogn)