Rectilinear block placement using B*-trees

Due to the layout complexity in deep sub-micron technology, integrated circuit blocks are often not rectangular. However, literature on general rectilinear block placement is still quite limited. In this paper, we present approaches for handling the placement for arbitrarily shaped rectilinear blocks, based on a newly developed data structure called B*-trees. Experimental results show that our algorithm achieves optimal or near optimal block placement for benchmarks with multiple shaped blocks