General purpose collision detection library for the use with LÖVE.
Go to file
Matthias Richter ce4b8011da Collision detection using GJK/EPA instead of SAT.
The Gilbert–Johnson–Keerthi collision detection algorithm is
significantly faster than collision detection using the separating axis
theorem. GJK can only determine whether two shapes collide, but not the
penetration vector. The expanding polytype algorithm can use information
from GJK to quickly find the required vector.
2012-05-20 16:50:35 +02:00
class.lua Switch to light vector module 2012-04-12 16:07:50 +02:00
gjk.lua Collision detection using GJK/EPA instead of SAT. 2012-05-20 16:50:35 +02:00
init.lua Switch to light vector module 2012-04-12 16:07:50 +02:00
polygon.lua Remove unpackHelper from polygon.lua 2012-05-19 17:31:19 +02:00
README Fix triangulation. Use class-commons. Add hash:draw() 2012-01-22 00:09:54 +01:00
shapes.lua Collision detection using GJK/EPA instead of SAT. 2012-05-20 16:50:35 +02:00
spatialhash.lua Remove debug print in hash:update() 2012-04-26 20:29:33 +02:00
vector-light.lua Switch to light vector module 2012-04-12 16:07:50 +02:00

General Purpose 2D Collision Detection System

Documentation and examples here:
http://vrld.github.com/HardonCollider