I've got a collections of objects, each object is either a polygon or a circle, each with translation-vectors and rotation around a point.
I haven't really been able to try anything yet but from some research I know that you have to split the concave polygons into convex polygons and then apply a collision algorithm to them.
From my research, SAT came up a lot but some others did too, a lot of the related posts I found were quite old so the links and references weren't usable anymore.
The problem is that I don't know if they let you get the Point of Impact and Time of Impact or just let you translate the objects along the vector perpendicular to the nearest surface (as to travel the minimum distance). My criteria are efficiency and to some extend simplicity.
So my question is: which algorithm should I use to determine the Point and Time of Impact for a collision between possibly concave polygons and/or spheres that each have their own translation vector and rotation around a point (both of which could be 0).