ManDay

09-27-2011, 03:04 PM

I need to decompose a uniform 3D orthogoanl grid into subdomains such that 1) each subdomain has approximately the same number of vertices (inside) and 2) the subdomains, under that constraint, are as relaxed as possible.

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?

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?