PQP release

[Ming Lin]

PQP: Proximity Query Package

We announce the release of a new proximity query package called PQP. It is
a library for performing three types of proximity queries on a pair of
geometric models composed of triangles. They are:

1.  Collision detection - detecting whether the two models overlap, and
optionally, all of the triangles that overlap.

2. Separation distance computation - computing the minimum distance between
a pair of models, i.e., the distance between the closest pair of points.

3. Tolerance verification and approximate distance queries - determining
whether two models are closer or farther than a tolerance distance.

It uses OBBs for collision detection and family of swept sphere volumes for
distance computation and tolerance verification.  It has been successfully
applied to virtual prototyping, dynamic simulation, path planning and other
applications. It is applicable to all triangulated polygonal models,
including polygon soups.  It is free for non-commercial use.

More information about the package, new proximity query algorithms, MPEG
demonstrations and related publications can be found at:

     http://www.cs.unc.edu/~geom/SSV




-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html.