In other words:
I need to decompose an arbitrary volume which is delimited by orthogonal faces into subvolumia of equal size and as relaxed as possible (the discrete "grid-based" solution is then the best approximation of this continuous decomposition).
Although this seems like a typical problem one would be faced with in, say, HPC, I cannot find any good resources on this. I have some ideas, but those are rather vague and given, that such a problem must have been solved thoroughly in the past, I was wondering where to find literature on the etablished algorithms. Do you have an idea?