Presentation	2001/5/11 L-Shaped Block Packing using an O-Tree Representation Satoru OKAMOTO, Kunihiro FUJIYOSHI,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	O-Tree is one of the representation method of rectangle packing. It can represent any packing where no block can shift leftward and downward, and packing based on any given O-Tree can be obtained in linear time. A method to extend sequence-pair to represent L-shaped block is proposed, and a packing based on a sequence-pair can be obtained in O(n^3) or O(n^2).In this paper, we propose a method to extend O-Tree to represent L-shaped block packing with keeping the features of O-Tree.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	O-Tree / packing / L-shaped block
Paper #	VLD2001-15
Date of Issue

Conference Information
Committee	VLD
Conference Date	2001/5/11(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)	L-Shaped Block Packing using an O-Tree Representation
Sub Title (in English)
Keyword(1)	O-Tree
Keyword(2)	packing
Keyword(3)	L-shaped block
1st Author's Name	Satoru OKAMOTO
1st Author's Affiliation	Department of Electrical and Electronic Engineering, Tokyo University of Agriculture & Technology()
2nd Author's Name	Kunihiro FUJIYOSHI
2nd Author's Affiliation	Department of Electrical and Electronic Engineering, Tokyo Urfiversity of Agiriculture & Technology
Date	2001/5/11
Paper #	VLD2001-15
Volume (vol)	vol.101
Number (no)	46
Page	pp.pp.-
#Pages	6
Date of Issue