搜索资源列表
zjdd
- VC++的“最近点对问题”，-VC "point to the recent problems," Guangguang 04:40
二维最近点
- 该程序实现对二维数据轴上的最临近点的求解问题 采用方法：分治方法-procedures to achieve the two-dimensional data of the axis points near the methodology used to solve the problem : the administration
一维最近点（分治法）1
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：分治方法1（该方法在递归时由于使用数组的值，使得递归进栈的数据很多，消耗系统空间很大，所以处理的个数经测试不超过70个，可见在设计程序时，考虑空间的使用也是很必要的！）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : a partition method (the me
一维最近点（分治法）2
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：分治方法(找出中位数,两边递归）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : the administration (to identify the median on both sides, the recursive)
一维最近点（传统法）1
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：计算每对顶点间的距离，比较之 效率为O(n2)-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : for each pair of vertices the distance, a comparison of the efficiency of O (n2)
一维最近点（传统法）2
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：传统方法2:先排序，然后一次线性扫描，得到最近距离，时间复杂性O（nlogn）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : The traditional two methods : first order, and then a linear scan, rece
最近点对问题，分别用蛮力法和分治法进行了求解
- 最近点对问题，分别用蛮力法和分治法进行了求解，算法已经做过优化-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
GLTree020109
- 国外编写的高效多维临近点查找程序，可用与三维离散点数据的最近点查找。-Abroad, the preparation of high-performance multi-dimensional approach of point search procedure, can be used with three-dimensional discrete data points, the most recent search.
lianbiao
- 实现链表的数据读入，查找，查找最近点等基本功能，适合于初次学习链表数据结构的学者。-The realization of the data read into the list, find, find the basic functions such as nearest point for the initial learning of the scholars list data structure.
Sort
- 是做的一个分割文件的算法以及,寻找给定点的最近点的算法-Is to do a partition of the algorithm, as well as documents to find the nearest point to fixed-point algorithm
closest
- VC++最近点对用图形界面实现,大家可以学习一下，可能会存在一些缺陷-VC++ with the nearest point on the graphical interfaces
NearestPoints
- 分别利用分治法及穷举法求解最近点对问题，输出查找结果及比较次数。-Use, respectively, sub-rule method and brute-force method for solving the nearest point of the problem, the output and compare the number of search results.
algorithm_project2
- 这是求在一堆点中，找出最短距离的两个点对的算法问题。(Point pair problem with the shortest distance.)
最近点对
- vs2010 c++解决最近点对问题，适合初学者(closest pair, for beginners)
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)
最近点界面演示
- 随机生成焊点，动态演示求最近点判断焊盘是否熔断