搜索资源列表
计算几何算法
- 计算几何常用算法，包括点是否在多边型中，判定两条直线是否相交，平面最近点对-computational geometry algorithm commonly used, including whether a multilateral type in determining whether the intersection of two straight, the nearest point on Plane
一个非常好用的Autocad工具集
- ********************************************************* * AyungerStudio AutoCAD-Tools 更新日期: 2010.02.01 * ********************************************************* 这是本人近年来独自开发的一个AutoCAD修改工具集合，现与各位共享，主要包括： 1、 绘制类： 箭头、示坡线、锥坡线、剖断线、垂线、切线、等高线加
zjdd
- 用于计算二维平面上一个点集的最近点对，可以计算100000个点的规模-Used to calculate the two-dimensional plane, a set of points the last points, we can calculate the size of 100000 points
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.
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
cloestPair
- 最近点对程序，java实现。可以计算平面内的最近点对-The nearest point on the program, java implementation. Can calculate the closest point on plane
ClosestPairOfPoints
- 本文实现了平面内NlogN时间内，查找最近点对的算法，欢迎大家下载-This implements the plane NlogN time, find the nearest point of the algorithm, are welcome to download
closepair
- 二位平面中求最近点对的问题，采用分治的方法，按照书本的算法实现-Two nearest points on the plane ask the question, the use of divide and conquer approach, in accordance with the books of the algorithm
zuijindui
- 该代码采用分治法解决在平面内求最近的点对的方法-The code uses a divide-and-conquer method to solve the nearest point on the plane and
ClosestPair
- 平面最近点对问题是计算几何学中研究的基本问题之一。假设在平面S上有n个点，在这n个点所组成的点对中，寻找距离最近点对问题。例如：有两点 与 。它们之间的距离为： 。n个点可以组成 个点对，找其中的一点对，使得在n个点组成的所的点对中，该点对的 为最小。-Plane closest point to the problem is one of the basic problems of research in computational geometry. Suppose there are n
voronoi
- 从Voronoi结构所脱胎的计算几何来看，Voronoi图是对平面n个离散点而言的，它把平面分为几个区，每一个区包括一个点，该点所在的区是到该点距离最近点的集合。-From the perspective of a Voronoi structure have spun out of the computational geometry, Voronoi diagram is for plane n discrete points, it put the plane is divided int
ClosetPairOfPoints
- 求平面点集最近点对，算法导论课程实验，基本实现，可借鉴-For the nearest point on the plane point set, introduction to algorithms course experiment
CPPT
- 给定一个平面，内有n个点，找出其中距离最近的两个点。采用图形界面，n的个数大于100，随机生成点。 采用QT Creator生成坐标轴界面 分而治之算法计算最近点对。-Given a plane, there are n points, find out where the nearest two points. Use graphical interface, the number n is greater than 100, randomly generated points. QT Cre
Computational-Geometry
- 点是否在多边型中、判定两条直线是否相交、平面最近点对-Point is in polygon, it is determined whether the two lines intersect, the nearest point on the plane
ClosestPair
- 求解平面最近点对，分治经典题目。。。。。。。(The program to solve the nearest point pair of the plane, divide and conquer the classic topic.)
closest_pair_of_points
- C++11标准下编写的平面最近点对算法，包括暴力算法与O(nlogn)的算法。使用纯面向对象的方式编写，提供了测试类。(The plane closest point pair algorithm based on C++11 standard, including the algorithm of violent algorithm and O (nlogn). Written in a purely object-oriented way, it provides test classes.
平面内最近点对
- 分治算法练习，使用分治算法实现计算平面内最近点对距离。子问题将平面划分为左右两部分分开计算最短距离，再在中间条带中找是否有更近点对。(Divide and conquer algorithm to calculate the closest point pair in the plane)