Rectangle Packing Evaluation of the Region Packing Problem

The data set contains three classes of packing problems. The first class contains only rectangles of the same height. The second class only rectangles of the same height with one very big rectangle and the third class contains two to five big rectangles.

The resulting packing was evaluated using a simple heuristic, a novel rectangle packing algorithm "rectpacking", and the optimal solution calculated using a constraint solver.

The data was analyzed regarding width, height, area, aspect ratio, and scale measure of the resulting packing.