Computing the Distance between Objectswww.comlab.ox.ac.uk/people/stephen.cameron/distances An implementation of the Gilbert, Johnson, and Keerthi (GJK) algorithm for tracking the distance between a pair of convex polyhedra. Source available for nonprofit use.
I_COLLIDEwww.cs.unc.edu/~geom/I_COLLIDE An interactive and exact collision-detection library for convex polyhedra. Includes the source code (free for noncommercial use), relevant papers, and an MPEG demonstration.
RAPID: Robust and Accurate Polygon Interference Detectionwww.cs.unc.edu/~geom/OBB/OBBT.html A numerically robust library supporting general polygon soups, based on oriented bounding box (OBB) trees. The source is available for noncommercial use via email. A paper on OBB trees is available for download.
V-Clip Collision Detection Librarywww.merl.com/projects/vclip An implementation of the Lin-Canny algorithm for computing the distance between two closed polyhedra. Source available for noncommercial use.
V-Collidewww.cs.unc.edu/~geom/V_COLLIDE A collision detection library for general polygon soups. Combines I_COLLIDE's "sweep and prune" algorithm with RAPID. Source available for noncommercial use.
The Jesus Army is not responsible for the content of the Open Directory, which we provide here as a public service. Please contact the Open Directory Project with any questions or comments you may have, or follow the links above.