A new floorplaning by HPG: Hamilton path-based graph representation

A new Hamilton path-based graph (HPG) representation for the general floorplan is presented. There is a unique HPG for any floorplan, and any HPG can be decoded to a unique floorplan in O(n) time. HPG is such a transparent data-structure that it makes the feature of the floorplan explicit. far compared with the preceding data-structures Q-seq or CBL. A placement algorithm optimizing only the area is implemented with insertions of a certain number of empty rooms. Experimental results show that HPG can get better results than those by O-tree, enhanced O-tree, CBL, B*-tree, TCG and Enhanced Q-Sequence in shorter time.