right now i have sweep and prune working in a 2d physics engine with one list where i sort all the bounding boxes by their minX i was wondering though, how to implement sweep and prune with two sorted lists (x and y) is it possible to do so without increasing the complexity (exponentially that is)? thank you Oz

Quote:Original post by ozmic66
is it possible to do so without increasing the complexity (exponentially that is)?

Sure, it just requires a little more bookkeeping. I don't know if books are an option for you, but both Gino van den Bergen's and Christer Ericson's books include detailed discussions of various implementations of sort and sweep.