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: 使用分治法求大量点中的最近点对.使用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: 最小点对问题（二维）
二维最接近点对问题：给定平面上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:
Search - Closest pair of points