Bin Packing Problem

Hello all,Can you please help me out a little bit on bin packing problem?I have a jpanel and i want to divide its space in order to put rectangles but having in mind that i have to take advantage of all the empty space provided by the jpanelthnx,John
[285 byte] By [ForteDevelopera] at [2007-9-29 17:12:34]
# 1
Can anybody help me, about the bin packing algorithm...
husamsofta at 2007-7-15 15:55:38 > top of Java-index,Other Topics,Algorithms...
# 2
http://www.google.co.uk/search?hl=en&q=bin+packing+algorithm&btnG=Google+Search&meta=
sabre150a at 2007-7-15 15:55:39 > top of Java-index,Other Topics,Algorithms...
# 3

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/

dtrebbiena at 2007-7-15 15:55:39 > top of Java-index,Other Topics,Algorithms...
# 4
Isn't the best first a reasonable aproximation?
Lord_of_the_chaosa at 2007-7-15 15:55:39 > top of Java-index,Other Topics,Algorithms...
# 5
I'm not quite sure I understand.It is oftenly not possible to find the best solution to this kind of problem, so algorithms exist to find suitable approximations.
dtrebbiena at 2007-7-15 15:55:39 > top of Java-index,Other Topics,Algorithms...