Sliceable floorplanning by graph dualization

Previous algorithms on rectangular dual graph floorplanning generate general floor-plans which include the class of nonsliceable floorplans. We examine the framework of generating sliceable floorplans using the rectangular dual graph approach and present an algorithm that generates a sliceable floorplan if the input graph satisfies certain sufficient conditions. For general input, the algorithm is still able to generate sliceable floorplans by introducing pseudomodules where the areas occupied by the pseudomodules are used for wiring. For an $n$-vertex adjacency graph, the algorithm generates a sliceable floorplan in $O( n\log n + hn )$ time where $h$ is the height of the sliceable floorplan tree.