Question

How does rectangle packing algorithm is implemented for given n rectangles ?

Answer 1

Packing problems are a class of optimization problems in mathematics which involve attempting to pack objects together (often inside a container), as densely as possible. Many of these problems can be related to real life packaging, storage and transportation issues. Each packing problem has a dual covering problem, which asks how many of the same objects are required to completely cover every region of the container, where objects are allowed to overlap.
In a packing problem, you are given:
'containers' (usually a single two- or three-dimensional convex region, or an infinite space)
'goods' (usually a single type of shape), some or all of which must be packed into this container
Usually the packing must be without overlaps between goods and other goods or the container walls. The aim is to find the configuration with the maximal density. In some variants the overlapping (of goods with each other and/or with the boundary of the container) is allowed but should be minimized.

Answer 2

rest you can read from here: http://en.wikipedia.org/wiki/Packing_problem
cheers :)

Answer 3

havent implemented it before but hope this will work http://codeincomplete.com/posts/2011/5/7/bin_packing/

Answer 4

@farmdawgnation can you please help with the implementation thing ?

Answer 5

Oooo. Packing algorithms. I haven't done these before.

Answer 6

me too thats why i called you lol anyways can you refer someone else

Answer 7

@Neeraj_OCW Have you done these before?

Answer 8

@farmdawgnation No. I wanted to make a sprite packing tool to pack all images into a single image with minimal area required. I googled came to know that's it's called rectangle packing / tile mapping.