Re: Algorithm to fit rectangles with different areas inside a matrix with lowest complexity


Can you point me to some algorithms, that try to solve problems similar
to this in an optimum way ?


When you load furniture in a moving van, you put the big objects in first and fill in the small ones later. In this case, "big objects" would be the ones that would be the biggest if they couldn't be placed under rule one or two. Would it be possible to prioritize the objects in this way?

Are there any patterns in the way locations cause objects to be sized? For example, row 2 col 2 always makes an object placed there grow?
.