Plane tiling into rectangles of irregular sizes

Question

I have a grid of a fixed size. I'm trying to tile it into multiple rectangles of different sizes. The size difference is needed because I have to balance the content of each rectangles in order to parallelize the process and have balanced threads.

The grid contains individuals, so some cases may be free, others may contain different types of individuals.

I've been told to look into "Plane tiling algorithms" but I can't seem to find anything or can't find the right term for what I'm looking for.

Answer 1

It looks to me like you want to do space subdivision in order to have some kind of search operations up and running in a balanced way.

For that, there are Quadtrees available, balanced Binary Space Partitioning Trees , and Kd trees .

If you need optimized parallel space partitioning, there is a great article about parallelized Octree and a related library coming from Uni Bonn, Germany which is quite recent, and the library is open source.