I believe your goal can be reduced to "packing each box so it has the
smallest amount of wasted space".
(and with your shapes, it may be possible to reduce it further to
"each layer of the objects in the box, should have the smallest amount
of wasted space", since your objects are just 2D.
Now,
On 14 Říj, 06:18, Legend <[EMAIL PROTECTED]> wrote:
> Suppose that I have some data:
>
> 12,30
> 12,45
> 2,3
> 7,8
> 3,9
> 30, 8
> 45,54
> 56,65
>
> Where (a,b) indicates that a is connected to b. I want to get all
> connected nodes to one point. For instance, the output of the above
> example s
Hi,
I have a different number of different shaped profile bars which I
need to fit into as few boxes as possible. The box has a fixed size.
The profiles are always the same length, which means the problem only
needs to be solved on 2 dimensions. The shape of the profiles are
either rectangular or
Algo:
1. Maintain a separate array class[] to indicate which element(a,b) belong
to which class
2. assign first(a,b) to class 1. in eg: 12,30 to class 1
3. for each other element from then compare with members of existing class
if yes assign this element with same class, else assign different cla
Legend wrote:
> Suppose that I have some data:
>
> 12,30
> 12,45
> 2,3
> 7,8
> 3,9
> 30, 8
> 45,54
> 56,65
>
> Where (a,b) indicates that a is connected to b. I want to get all
> connected nodes to one point. For instance, the output of the above
> example should be something like:
>
> Group 1
>
