Denser Packings Obtained in O(n log log n) Time

The placement problem is that of packing a set of rectangles into a minimum-area enclosing rectangle. Since it is difficult to optimize directly on a placement, a number of topological representations have been presented in the literature. One of the most successful is the sequence pair representati...

Ausführliche Beschreibung