000K  utf8
1100  2025$c2025-08-01
1500  eng
2051  10.57892/100-263
3000  Domrös, Sören
4209  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.
4950  https://doi.org/10.57892/100-263$xR$3Volltext$534
4961  https://opendata.uni-kiel.de/receive/fdr_mods_00000263
5051  000
5550  Graphenzeichnen
5550  Rectangle Packing