Software Collision Detection Algorithms and Data Structures

Computers

@InterMall Software Shoppe - Discount computer software at greatly reduced prices - Games, business, graphics, educational, desktop publishing, reference, and much more! [Preview] Amazon.com Electronics - Top selling consumer electronics at Amazon.com -- camcorders, cameras, home theatre, PDA's, phones, televisions, computer hardware and software and more! Shopping at Amazon.com is always 100% secure, guaranteed. [Preview] >> List Your Site Here << [Top]

Top: Computers: Programming: Graphics: Algorithms_and_Data_Structures: Collision_Detection: Software:

• - A free library intended for game programming. Supports general polygon soups and based on bounding-box hierarchies. Open source, from The Photon Effect.
  
• - A free collision detection library. Source code, example and theory of collision detection available for download.
  
• - LGPL standard C++ library for interactive collision detection, based on axis-aligned bounding box trees.
  
• - An implementation of the Lin-Canny algorithm for computing the distance between two closed polyhedra. Source available for noncommercial use.
  
• - 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.
  
• - An interactive and exact collision-detection library for convex polyhedra. Includes the source code (free for noncommercial use), relevant papers, and an MPEG demonstration.
  
• - General-purpose collision detection library, capable of handling general polygon soups. Based on hierarchies of bounding volumes of discrete-orientation polytopes. Free source for noncommercial use.
  
• - A collision detection library for general polygon soups. Combines I_COLLIDE's "sweep and prune" algorithm with RAPID. Source available for noncommercial use.
  
• - 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.