I'm sure someone else in the world has thought a great deal about this, but my Google-foo is thwarted by not knowing what keywords to use.
One way to think about the problem: I have some number of hyperrectangles. These shapes may overlap. I want to slice up my hyperrectangles into smaller hyperrectangles such that:
Here is a visual example in two dimensions.
- No hyperrectangles overlap.
- There are as few hyperrectangles as possible.
I'm trying to come up with a good algorithmic way of doing this without using a ton of memory. Any suggestions for search terms or algorithms would be appreciated.