How about BSP partitioning the world and the points?
Lets say for 2 cores:
All points with +y and all rectangles with a +y edge go through core 1
All points with -y and all rectangles with a -y...
Type: Posts; User: Salem
How about BSP partitioning the world and the points?
Lets say for 2 cores:
All points with +y and all rectangles with a +y edge go through core 1
All points with -y and all rectangles with a -y...
Some questions.
1. How large is the "world" compared to the shape?
If your shape covers say 10x10 in a world which extends to 1000x1000, then a random distribution of points would most likely be...
As a matter of good form, it's important that you tell people where you've also cross-posted.
Geometric Search/intersection Problem - C And C++ | Dream.In.Code
Otherwise, people are potentially...