搜索资源列表
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
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.
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.
KitBag
- 分治法和蛮力法求解最近点对问题,不好意思中文传不了,改传背包问题了。-leastport
Divfuntion
- 算法分析实验 算法分析分治法 最近点对问题-Experimental analysis of algorithms analysis of algorithms divide and conquer the nearest point of the problem
shortestpath
- 用蛮力法和分治法求最近点对的问题-用蛮力法和分治法求最近点对的问题............
zuijingdiandui
- 基于MFC单文档实现的最近点对的算法,是图形界面的-MFC single document based on the closest point to the realization of the algorithm is a graphical interface
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
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
divide1
- 最近点对问题:分治法解决 时间复杂度:O(nlogn)-the closest point problem "divide and conquer" time complexity:O(nlogn)
DistPoint
- 最近点对。编程之美上面的点对,使用了C++模板,效果还可以-the nearest point diatance
closepointpair
- 使用Java实现的求最近点对的方法,实现了一个界面,可手动输入点或自动生成点-Using Java implementation of the nearest point on the way to achieve an interface that can be entered manually or automatically generate dot dot
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