Implement special case for BruteForce nearest neighbor

[aprokop]

We can still do tiling algorithm similar to the spatial search when using BruteForce in the following special case: each query only requires finding a single nearest neighbor. We won't need priority queues, and would simply need to use atomic mins to sync the distances among threads.