#Data structure for non evenly distributed resources, adding and removing, fast finding nearest

1 messages · Page 1 of 1 (latest)

fair anvil
#

Hi, I want to find a data structure to hold resources that would be scattered over a few KM squared, some areas lots others none. I would have new ones being added and resource collectors finding them (and then removing them). I'm not using ECS but already have some burst/jobs processes going on. It seems from my research that maybe a quad/octree would be a decent route, though the ones that I've found online seem to struggle with removing entries (such as https://github.com/bartofzo/NativeTrees) or are quite out of date.

I'm not super familiar with DOTs in general so hoping I can adapt something... Thanks!

barren crater
#

extremely fast to build, with lookup cost of multihashmap