Question

I want to make an infinite tiled map, from (-max_int,-max_int) until (max_int,max_int), so I’m gonna make a basic structure: chunk, each chunk contain char tiles[w][h] and also it int x, y coordinates, so for example h=w=10 so tile(15,5) is in chunk(1,0) on (5,5) coordinate, and tile(-25,-17) is in chunk(-3,-2)on(5,3) and so on. Now there can be any amount of chunks and I need to store them and easy access them in O(logn) or better ( O(1) if possible.. but it’s not.. ). It should be easy to: add, ??remove??(not must) and find. So what data structure should I use?

Answer 1

Read into KD-tree or Quad-tree (the 2d variant of Octree). Both of these might be a big help here.