web nectar

Wectar - Computers - Programming - Graphics - Algorithms and Data Structures - Collision Detection - Software

         

  submit a site to this category
   


URL: http://www.merl.com/projects/vclip/
ODP description: An implementation of the Lin-Canny algorithm for computing the distance between two closed polyhedra. Source available for noncommercial use.
Page title: MERL – V-Clip Collision Detection Library
Page description: MERL - Mitsubishi Electric Research Laboratories

URL: http://www.cs.unc.edu/~geom/I_COLLIDE/
ODP description: An interactive and exact collision-detection library for convex polyhedra. Includes the source code (free for noncommercial use), relevant papers, and an MPEG demonstration.
Page title: I-Collide

URL: http://www.cs.unc.edu/~geom/OBB/OBBT.html
ODP description: 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.
Page title: RAPID -- Robust and Accurate Polygon Interference Detection System

URL: http://www.comlab.ox.ac.uk/people/stephen.cameron/distances/
ODP description: 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.

URL: http://www.cs.unc.edu/~geom/V_COLLIDE/
ODP description: A collision detection library for general polygon soups. Combines I_COLLIDE's "sweep and prune" algorithm with RAPID. Source available for noncommercial use.
Page title: V-Collide Collision Detection

URL: http://www.win.tue.nl/~gino/solid/
ODP description: LGPL standard C++ library for interactive collision detection, based on axis-aligned bounding box trees.
Page title: SOLID - Software Library for Interference Detection
Page description: Collision Detection Library



  
Help build the largest human-edited directory on the web.
Submit a Site - Open Directory Project - Become an Editor
  powered by Sphinx