Is there a way to speed this test up using SIMD? Or a least a faster method than the naive approach, which is:
for(int i=0; i<numA; i++){ for(int j=0; j<numB; j++){ if(intersects(setA(i), setB(j)) // Output pair }}
I'm not looking for any spatial partitioning methods, as I'm already using them to cull the initial set. Sets A and B are what's left over. I just need a faster O(n^2) algorithm.