how to use opennero in the strip packing problem

[GoogleCodeExporter]

This is the problem of packing a set of n rectangles into an open-ended bin of 
fixed width C and infinite height. (the rectangles must not overlap each other) 
The idea is to pack the rectangles in a way that minimises the overall height 
of the bin. The clear difference between this problem and the two-dimensional 
bin packing problem, is that there is only one bin, so instead of trying to 
minimise the number of bins used, the aim is to minimise the height of the 
single bin. All the rectangles must be packed and can be rotated 0,90,180,270 
degree.
What is the expected output? What do you see instead?

any good idea?

thanks

Original issue reported on code.google.com by jjq...@gmail.com on 9 Sep 2011 at 12:56

[GoogleCodeExporter]

Hi, this is perhaps a better question to ask by emailing the discussion group 
(see http://groups.google.com/group/opennero). I'm going to close this since 
it's not really a bug, but please go ahead and ask this question there!

Original comment by ikarpov on 11 Sep 2011 at 6:18

• Changed state: Invalid