By default the algorithm expands the AABBs as an optimization step to reduce the amount of changes done to the tree between updates. This means that a query does a broad phase search first then the user is expected to do a narrow phase with the result. In other words, there could be many false positives in the results.
I could be useful to allow the expand constants to be fine tuned for each project.
By default the algorithm expands the AABBs as an optimization step to reduce the amount of changes done to the tree between updates. This means that a query does a broad phase search first then the user is expected to do a narrow phase with the result. In other words, there could be many false positives in the results.
I could be useful to allow the expand constants to be fine tuned for each project.