I'm currently working on a project that requires a thread to construct a queue of 30(ish) nearest processes closest to the player within a 3D environment.
All of these processes can move about the environment, as well as leave their starting nodes that they were placed in. I have considered using R trees, but due to its ludicrously high insert times, it does not seem very viable.
KD- Trees would not work, since they tend to only work for static environments.
Note also that this will be running async to the main update thread, so an atomic approach would work best.
Can someone suggest an approach?