AABB Trees   This week (or year, if you’ve been following the column) is on AABB (axis aligned bounding box) trees, the lovely and efficient bounding volume hierarchy that will bring you back into the realm of happiness… … and maybe let you speed some things up along the way. Not only that, I’ve included some sample code and a demo. Author WebMaster    Last update 2003-05-07  English

Collision Detection algorithms (very good)   The problem of collision detection between moving objects is fundamental to simulations of the physical world. It has been studied in many different communities including robotics, computer graphics, computer-aided design, and computational geometry. There are several algorithms for collision detection. Examples include the Lin-Canny closest features algorithm, V-CLip, I-Collide, OBB-tree, and KDS. Author WebMaster    Last update 2003-05-07  English

Melax - Dynamic Plane Shifting BSP Traversal   Technical Demo Author WebMaster    Last update 2003-05-07  English

Rigid Body Dynamics   Physical simulation for games Author WebMaster    Last update 2003-04-12  English