Sweep-and-prune benchmarkSweep-and-prune benchmark This little page sums up various sweep-and-prune (SAP) tests. The goal is to find all colliding pairs in a set of N dynamic (moving) objects. We have three algorithms available : - brute force, performing N ( N-1) / 2 overlap tests - standard SAP algorithm (V-Collide implementation) - radix-based SAP In the following screenshots, you can see the results for N = 1024 movin
