09-24-2014, 03:14 PM
Have you ever thought about using the Separating axis theorem (SAT) for collision detection? It works for any convex polygon. By composing multiple polygons together, you should be able to create any shape you want. Along with the SAT, there's the Sweep and Prune (SAP) algorithm to improve collision detection speed.
Some links
http://gamedev.stackexchange.com/questio...n-with-sat
http://gamedevelopment.tutsplus.com/tuto...amedev-169
http://jitter-physics.com/wordpress/?tag...-and-prune
Some links
http://gamedev.stackexchange.com/questio...n-with-sat
http://gamedevelopment.tutsplus.com/tuto...amedev-169
http://jitter-physics.com/wordpress/?tag...-and-prune