4
$\begingroup$

I'm a noob, and I'm not a mathematician (Although I will be a Math major next semester). My question is:

I have 68 maps I would like to use as posters on my wall at home. They are all rectangles, and all different dimensions. Is there an algorithm (or better yet, a website or other simple computer program I can use) to take the dimensions of all these posters as input and then compute the optimal tiling arrangement on the wall so there is little as possible "wasted" empty space?

  • 0
    You have multiple copies of each of the 68 maps?2010-09-10
  • 0
    Can any be turned sideways?2010-09-10
  • 0
    See Jamie Zawinski's [Picture Tile](http://www.jwz.org/picturetile/).2010-09-10

2 Answers 2

2

This problem is known as 2-dimensional bin packing, and some algorithms for this problem can be found here:

http://www.csc.liv.ac.uk/~epa/surveyhtml.html

1

You are attempting to solve what is referred to as a "packing problem". It's generally a hard problem but for your case I think that the existing methods will work. Try looking here:

http://pollinimini.net/blog/rectangle-packing/

It seems he has already coded something. If it's not what you're after, google "rectangle packing" and I'm sure you'll run into something.