搜索资源列表
Nearest
- 分别利用分治法及穷举法求解最近点对问题,输出查找结果及比较次数。-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.
dbPoint.c
- C语言实现,分治法求平面中任意个点的最近点对和最近距离。-C language implements, find out the shortest point pair and the shortest length between arbitrary points in a plane, with divide and conquer method.
KitBag
- 分治法和蛮力法求解最近点对问题,不好意思中文传不了,改传背包问题了。-leastport
CLOSESTPAIR
- 最近点对问题,求解平面上n个点的集合中距离最近的两点的距离。-Nearest point of the problem, solving the plane the set of n points in the distance between the nearest two points.
Divfuntion
- 算法分析实验 算法分析分治法 最近点对问题-Experimental analysis of algorithms analysis of algorithms divide and conquer the nearest point of the problem
shortestpath
- 用蛮力法和分治法求最近点对的问题-用蛮力法和分治法求最近点对的问题............
PointPair
- 根据分治算法实现求平面上最近点对的复杂度为(nlgn)的算法 有图形界面,能通过鼠标输入点-Under sub-rule algorithm seeking the nearest point on the plane of the complexity of (nlgn) algorithm for graphical interface, through mouse input points
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 " Algorith
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
suanfa
- 请选择操作: 1. 最近点对 2. 假币问题 3. 堆排序 4. 全源最短路径-Please choose: 1. Nearest points on 2. Counterfeiting problem 3. Heap sort 4. All source shortest path
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
pairdistance
- 在C语言环境下,实现寻找空间中最近点对的有效算法。-In the C language environment, to achieve search space, the nearest point on the efficient algorithm.
Dataregistrationin3-Dscanningsystems
- 通过引入特征点和改进最近点迭代法, 提出了一种 在三维扫描系统中对三维点云数据进行配准的方法。该方法 通过对特征点的提取, 首先得到一组匹配点对, 然后运用 SVD 矩阵分解算法求出转换参数R 和T, 进而以此作为最 近点迭代法的初始值, 并对最近点的求法和迭代截止条件作 了改进, 得到了很好的配准效果。该文论述了该方法的基本 原理, 并通过不同视觉下物体三维测量点云数据配准的应用 实例证明了该方法的有效性。
fenzhifa
- 用c++实现分治法算法的最近点对问题(在VS2008平台上)-Using c++ implementation of divide and conquer algorithm for the nearest point of the problem (in VS2008 platform)
searchnearestnode
- 程序实现给定平面上N个点的坐标,找出距离最近的两个点.程序中是两种方法寻找最近点对。解法一的时间复杂度是O(N^2)解法二的时间复杂度是(N*lg2/lgN)第二种方法较第一种方法在一维情况下,时间复杂度改进了不少。但是这个方法不能推广到二维的情况,因为距离最近的点对不能保证是影射到某条直线之后紧靠着的两个点。-the procedure can realize the Coordinate which have N nodes ,fi
newsearchthenearestnode
- 程序实现给定平面上N个点的坐标,找出距离最近的两个点.程序中是两种方法寻找最近点对。解法一的时间复杂度是O(N^2)解法二的时间复杂度是(N*lg2/lgN)第二种方法较第一种方法在一维情况下,时间复杂度改进了不少。但是这个方法不能推广到二维的情况,因为距离最近的点对不能保证是影射到某条直线之后紧靠着的两个点。-the procedure can realize the Coordinate which have N nodes ,fi
Thenearestpointofthealgorithm
- 最近点对的算法实现,希望大家互相学习,提建议。希望对您有帮助-The nearest point of the algorithm, I hope you learn from each other suggestions. I hope for your help