My favorites | Sign in
Project Home Downloads Wiki Issues Source
Project Information
Members
Featured
Downloads
Links

A collision detection implementation of the Minkowski Portal Refinement (MPR) Algorithm, written in the D programming language. Inspired by the work of Gary Snethen (Xeno).

Collision detection for 2D convex polygons and circles of any (almost!) complexity.

Please see the SVN for the latest code update.

Powered by Google Project Hosting