Rectilinear block packing using O-tree representation

Authors:
Yingxin Pang;Chung-Kuan Cheng;Koen Lampaert;Weize Xie
Affiliations:
Mindspeed Technologies, 4311 Jamboree Road, Newport Beach, CA;Dept. of CSE, University of California, San DIego, La Jolla, CA;Mindspeed Technologies, 4311 Jamboree Road, Newport Beach, CA;Hewlett-Packard Research Laboratories, Palo Alto, CA
Venue:
Proceedings of the 2001 international symposium on Physical design
Year:
2001

Citing 8
Cited 5

Arbitrary rectilinear block packing based on sequence pair

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
The multi-BSG: stochastic approach to an optimum packing of convex-rectilinear blocks

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Arbitrary convex and concave rectilinear block packing using sequence-pair

ISPD '99 Proceedings of the 1999 international symposium on Physical design
An O-tree representation of non-slicing floorplan and its applications

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
An enhanced perturbing algorithm for floorplan design using the O-tree representation

ISPD '00 Proceedings of the 2000 international symposium on Physical design
VLSI module placement based on rectangle-packing by the sequence-pair

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Module packing based on the BSG-structure and IC layout applications

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Sequence-pair approach for rectilinear module placement

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Stairway Compaction using Corner Block List and Its Applications with Rectilinear Blocks

ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Stairway compaction using corner block list and its applications with rectilinear blocks

ACM Transactions on Design Automation of Electronic Systems (TODAES)
On handling arbitrary rectilinear shape constraint

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
A fast algorithm for rectilinear block packing based on selected sequence-pair

Integration, the VLSI Journal
An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we extend the O-tree approach to handle rectilinear blocks. First we explore the properties of L-shaped blocks, then decompose rectilinear blocks into a set of sub-L-shaped-blocks. The properties of L-shaped blocks can be applied to general recti冒linear blocks. In order to explore the optimal search thoroughly, we generate four direction O-trees. A heuristic optimization algorithm based on the four direction O-trees produces very good experiment results.