Re: Help! - rectangle packing problem
- From: snow <rok.sibanc@xxxxxxxxx>
- Date: Tue, 19 Jun 2007 06:22:20 -0000
On Jun 19, 5:41 am, ihinayana <edward...@xxxxxxxx> wrote:
Description:
Given a group of rectangles with different integer width and
height,such as 5*4, 2*3,1*7,etc. The total number of rectangles is
like 10 or more.The problem is how to find a bigger rectangle with a
minimal area which can hold all those given ones. To fix them in,those
rectangles can be rotated with 90 degree and the order is regardless.
Did anybody solve a similar problem?
I was a part of circle packing online competition once, which sounds
very similar.
So you have to place your squares somewhere - x,y coordinates of let
say bottom left corner and also determine rotation.
So your genome would be N times (x,y,angle) where N is the number of
rectangles.
Now for your containing rectangle you will have to find: min x, max x,
min y, max y of all rectangles.
And you have to minimize this rectangle area.
Your fitness also has to take into account possible overlapping areas!
Just add some error for overlapping area.
Have fun,
Rok
.
- Follow-Ups:
- Re: Help! - rectangle packing problem
- From: David Kinny
- Re: Help! - rectangle packing problem
- References:
- Help! - rectangle packing problem
- From: ihinayana
- Help! - rectangle packing problem
- Prev by Date: Help! - rectangle packing problem
- Next by Date: Re: Help! - rectangle packing problem
- Previous by thread: Help! - rectangle packing problem
- Next by thread: Re: Help! - rectangle packing problem
- Index(es):
Relevant Pages
|
|