Maybe you mean 2-dimensional bin packing?
An example bin packing problem is this:
Jill has 42 files (of various sizes) that she needs to copy to another computer. She wants to use floppies (which hold 1.44 Mb of data). What is the minimum number of floppies required AND what combinations of files would be saved onto each of those floppies?
As an extension, a 2d bin packing problem incorporates a notion of area into the calculation.
(note that both problems are NP complete).
Here is a commercial company that specializes in this (found with Google, 2d bin packing algorithm):
http://www.astrokettle.com/