A tree based novel representation for 3D-block packing

Authors:
Kunihiro Fujiyoshi;Hidenori Kawai;Keisuke Ishihara
Affiliations:
Department of Electrical and Electronic Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan;Department of Electrical and Electronic Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan;Department of Electrical and Electronic Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2009

Citing 9
Cited 0

TCG: a transitive closure graph-based representation for non-slicing floorplans

Proceedings of the 38th annual Design Automation Conference
Automatic floorplan design

DAC '82 Proceedings of the 19th Design Automation Conference
Temporal floorplanning using 3D-subTCG

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Combinatorial Enumeration

Combinatorial Enumeration
Temporal floorplanning using the T-tree formulation

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
3-D floorplanning using labeled tree and dual sequences

Proceedings of the 2008 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
Floorplanning using a tree representation

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

Quantified Score

Hi-index	0.04

Visualization

Abstract

The 3D packing problem consists of arranging nonoverlapping rectangular boxes (blocks) of given sizes in a rectangular box of minimum volume. As a representation of 3D packings, this paper proposes a novel encoding method called Double Tree and Sequence (DTS). The following are features of DTS: 1) It can represent any minimal packing. 2) It can be decoded into the corresponding 3D packing in O(n2) time, where n is the number of rectangular boxes. 3) The size of the solution space (the number of codes) of DTS is significantly smaller than any conventional representation that can represent any packing. Experimental comparisons with conventional representations indicate the superiority of the proposed representation DTS.