Algorithms for Optimizing, Two-Dimensional Symbolic Layout Compaction

We describe a set of algorithms, called Supercompaction, for two- dimensional compaction of layouts. The algorithms minimize a one-dimensional objective function (pitch) by moving objects in the layout in two dimensions.