Module relocation to obtain feasible constrained floorplans

This paper considers the general problem of relocating modules to convert infeasible constrained floorplanner inputs into feasible ones. This is accomplished by placing modules in locations that attempt to minimize the standard deviation of module densities. Efficient geometric algorithms are developed and shown to be successful in obtaining feasible inputs. Experimental results examine the tradeoffs between achieving a good redistribution of density on one hand and minimizing the increase in wire length and the displacement of modules on the other.