Location:
Search - closest pair
Search list
Description: PQP is a library for performing three types of proximity queries on a pair of geometric models composed of triangles:
collision detection - detecting whether the two models overlap, and optionally, all of the triangles that overlap.
distance computation - computing the minimum distance between a pair of models, i.e., the distance between the closest pair of points.
tolerance verification - determining whether two models are closer or farther than a tolerance distance.
-PQP is a library for performing three types proximity of queries on a pair of geometric mode ls composed of triangles : collision detection-detecting whether the tw o models overlap, and optionally, all of the triangles that overlap. distance com putation-computing the minimum distance betw een a pair of models, ie, the distance between the closest pair of points . tolerance verification-determining whethe r two models are closer or farther than a toleran ce distance.
Platform: |
Size: 493643 |
Author: bilka |
Hits:
Description: PQP is a library for performing three types of proximity queries on a pair of geometric models composed of triangles:
collision detection - detecting whether the two models overlap, and optionally, all of the triangles that overlap.
distance computation - computing the minimum distance between a pair of models, i.e., the distance between the closest pair of points.
tolerance verification - determining whether two models are closer or farther than a tolerance distance.
-PQP is a library for performing three types proximity of queries on a pair of geometric mode ls composed of triangles : collision detection-detecting whether the tw o models overlap, and optionally, all of the triangles that overlap. distance com putation-computing the minimum distance betw een a pair of models, ie, the distance between the closest pair of points . tolerance verification-determining whethe r two models are closer or farther than a toleran ce distance.
Platform: |
Size: 493568 |
Author: bilka |
Hits:
Description: 最小点对距离，即ClosestPair，时间复杂度进行了优化-The program is used to find the closest pair points
Platform: |
Size: 16384 |
Author: chaplin |
Hits:
Description: 在原有的swift基础上，实现凸分解，计算非凸物体是否相交的碰撞检测程序。-SWIFT++ operates by first computing a surface decomposition of the input models. The pieces are then grouped hierarchically using convex hulls. A pair of bounding volume hierarchies (BVHs) are tested using an improved Lin-Canny closest feature tracking algorithm. SWIFT++ uses the SWIFT core for the overlap test between convex pieces in the BVHs.
Platform: |
Size: 771072 |
Author: 杨兰 |
Hits:
Description: 使用分治法求大量点中的最近点对.使用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
Platform: |
Size: 95232 |
Author: sparrow |
Hits:
Description: 完成一维，二维，的最接近点对问题，还有界面-Complete the one-dimensional, two-dimensional, the closest point on the issue, as well as the interface
Platform: |
Size: 3072 |
Author: 陈波 |
Hits:
Description: 寻找最近点对(... ... ... ... ... ... ...)-find closest path pair (.....................................)
Platform: |
Size: 11264 |
Author: lele |
Hits:
Description: 用分治法找一个平面内的最接近点对。时间复杂度为O（nlogn）.-Using a divide and conquer to find the closest point of the plane pair. Time complexity is O (nlogn)
Platform: |
Size: 2867200 |
Author: 康靖林 |
Hits:
Description: brute force closest pair algorithm
Platform: |
Size: 37888 |
Author: eman_mohamed |
Hits:
Description: 寻找平面中最接近的点对，利用算法使时间复杂度接近于O（nlogn）-Find the the plane closest point pair algorithm time complexity close to O (nlogn)
Platform: |
Size: 11264 |
Author: 何冬 |
Hits:
Description: 源程序实现最近匹配算法，从众多点中找到一对举例最近的点。-Look for the closest pair
Platform: |
Size: 1024 |
Author: Samdy |
Hits:
Description: Closest-pair problem
Platform: |
Size: 1024 |
Author: billy |
Hits:
Description: 给定一个特定的二维点集，求出其中距离最近的一对点-Find the closest pair of a certain 2D points set.
Platform: |
Size: 5090304 |
Author: DSQ |
Hits:
Description: 使用两种方法求最近点对，分别是双重循环和分支法，可以运行，java代码。-closest pair
Platform: |
Size: 2594816 |
Author: aiaiai |
Hits:
Description: 最近点算法，FCPP，c++语言，visual studio-The closest point algorithm, FCPP, c++ language, visual studio
Platform: |
Size: 1024 |
Author: 赵纯艺 |
Hits:
Description: 最小点对问题（二维）
二维最接近点对问题：给定平面上n个点，找其中的一对点，使得在n个点的所有点对中，该点对的距离最小。严格地说，最接近点对可能多于1对。
【本算法基于C++语言编写，在Windows平台的DEV C++下编译通过，且运行正常】
-The minimum point of the problem (two-dimensional) two-dimensional closest point of the problem: a pair of points given n points in the plane, looking for them, so that all points of n points, the point of minimum distance. Strictly speaking, the closest point to the possibility of more than one pair. The algorithm is based on C++ written language.
Platform: |
Size: 2048 |
Author: LEE |
Hits:
Description: 第1章 算法引论
1.1 算法与程序
1.2 表达算法的抽象机制
1.3 描述算法
1.4 算法复杂性分析
小结
习题
第2章 递归与分治策略
2.1 速归的概念
2.2 分治法的基本思想
2.3 二分搜索技术
2.4 大整数的乘法
2.5 Strassen矩阵乘法
2.6 棋盘覆盖
2.7 合并排序
2.8 快速排序
2.9 线性时间选择
2.10 最接近点对问题
2.11 循环赛日程表
小结
习题
第3章 动态规划
3.1 矩阵连乘问题
3.2 动态规划算法的基本要素
等(The first chapter is an introduction to Algorithms
1.1 algorithms and programs
Abstraction mechanism of 1.2 expression algorithm
1.3 description algorithm
Complexity analysis of 1.4 algorithms
Summary
exercises
The second chapter recursion and divide and conquer strategy
The concept of 2.1 speed return
The basic idea of 2.2 points therapy
2.3 two point search technology
Multiplication of 2.4 integers
2.5 Strassen matrix multiplication
2.6 checkerboard coverage
2.7 merge sort
2.8 quick sort
2.9 linear time selection
2.10 closest point pair problem
2.11 round robin calendar
Summary
exercises
The third chapter dynamic planning)
Platform: |
Size: 2375680 |
Author: Summer-LXN
|
Hits:
Description: 分治算法练习，使用分治算法实现计算平面内最近点对距离。子问题将平面划分为左右两部分分开计算最短距离，再在中间条带中找是否有更近点对。(Divide and conquer algorithm to calculate the closest point pair in the plane)
Platform: |
Size: 321536 |
Author: 七七七七七
|
Hits:
Description: vs2010 c++解决最近点对问题，适合初学者(closest pair, for beginners)
Platform: |
Size: 865280 |
Author: Echo-bcy
|
Hits:
Description: 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.)
Platform: |
Size: 16384 |
Author: Somo |
Hits: