An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules

Published: 01 Jan 2017, Last Modified: 10 Jun 2024Comput. Oper. Res. 2017EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•An iterative merging packing (IMP) algorithm for soft rectangle packing problem.•Prove IMP guarantees feasible layout under some conditions.•A strategy systematically assigns deadspace on the outline to rectangles.•A verified efficient algorithm for fixed-outline floorplanning with soft modules.
Loading