Presentation 2001/11/22
Rectilinear Block Packing using an O-Tree Representation
Kunihiro FUZIYOSHI, Satoru OKAMOTO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) O-tree, which has been proposed to represent rectangle packing, has some outstanding properties. One of them is that the packing which keeps all the constraints imposed by a given O-tree can be obtained in O(n)time, where n is the number of rectangles. Recently, methods to extend O-tree to represent L-shaped block packing were proposed. In this paper, a method to extend O-tree to represent rectilinear block packing is proposed. Also, a novel algorithm to obtain the packing which keeps all the constraints imposed by any feasible O-tree in O(nm)time is proposed, where m is the number of rectilinear blocks.The proposed algorithm can obtain the packing in O(n)time if all the blocks are convex.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) O-tree / packing / rectilinear-block / convex-block / concave-block
Paper # VLD2001-104,ICD2001-149,FTS2001-51
Date of Issue

Conference Information
Committee VLD
Conference Date 2001/11/22(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To VLSI Design Technologies (VLD)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Rectilinear Block Packing using an O-Tree Representation
Sub Title (in English)
Keyword(1) O-tree
Keyword(2) packing
Keyword(3) rectilinear-block
Keyword(4) convex-block
Keyword(5) concave-block
1st Author's Name Kunihiro FUZIYOSHI
1st Author's Affiliation Department of Electrical and Electronic Engineering, Tokyo University of Agriculture & Technology()
2nd Author's Name Satoru OKAMOTO
2nd Author's Affiliation Department of Electrical and Electronic Engineering, Tokyo University of Agriculture & Technology
Date 2001/11/22
Paper # VLD2001-104,ICD2001-149,FTS2001-51
Volume (vol) vol.101
Number (no) 467
Page pp.pp.-
#Pages 6
Date of Issue