quote:Original post by Eelcomain loop{while curtimecol=collision(targettime)if col!=null handle collision}collision routine(targettime)sweep n prune with aabb''sfor all colliding aabbs: numerical root finding algo on bounding circles of convex hulls.for all colliding boundig circles: binary time search on convex hulls themselves.return first collision
But with this structure, won''t you take only the ''first'' (what''s the first? The first found or the first in time?) collision in account?
