搜索资源列表
NNP
- 最近点对问题,输入数据生成器自动生成2位点对,输出制定电的最近邻-nearest point of the problem, the input data generator automatically generate two points right, electrical output of the nearest neighbor
computationgeometry
- 我的计算几何模板,求3d凸包,计算最远点对(nlogn),求最近点对,和二维凸包
closestpoints
- 输入一组点的x、y坐标 求解这些点之中,两个最近点的距离 使用分治法
icp匹配算法
- icp匹配算法
Geometer.rar
- 线段及直线的基本运算 1. 点与线段的关系 2. 求点到线段所在直线垂线的垂足 3. 点到线段的最近点 4. 点到线段所在直线的距离 5. 点到折线集的最近距离 6. 判断圆是否在多边形内 7. 求矢量夹角余弦 8. 求线段之间的夹角 9. 判断线段是否相交 10.判断线段是否相交但不交在端点处 11.求点关于某直线的对称点 12.判断两条直线是否相交及求直线交点 13.判断线段是否相交,
Graphics1
- 图形程序合集1:包括矩阵变换,2维裁剪,最近点求取等-Graphics program Collection 1: including matrix transformations, 2-D cutting, nearest point to strike, etc.
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
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
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
newsearchthenearestnode
- 程序实现给定平面上N个点的坐标,找出距离最近的两个点.程序中是两种方法寻找最近点对。解法一的时间复杂度是O(N^2)解法二的时间复杂度是(N*lg2/lgN)第二种方法较第一种方法在一维情况下,时间复杂度改进了不少。但是这个方法不能推广到二维的情况,因为距离最近的点对不能保证是影射到某条直线之后紧靠着的两个点。-the procedure can realize the Coordinate which have N nodes ,find the nearest distance betwee
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
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
close_pair
- 算法:求最近点对的实现。在vs2010上运行通过!-Algorithm: Find the nearest point on the realization. In vs2010 run through!