Presentation	1998/9/21 On Packing of Rectangles into a Small Plane Area Yoji KAJITANI,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	We discuss about possible reasons why the problem to pack rectangles on a plane into a small area is hard. Based on the conclusion, two new ideas, BSG and Sequence-Pair, are introduced which are special data strucutures, called the quad-direction-methods. Experiments show that they easily pack hundreds of rectangles by flat computaion, even tens of thousands rectangles if the method implemented hierachically. It is a breakthrough for the practical problem size. Several enhancements and developments are introduced. Examples are, packing of objects which are of general shape, routing area included, soft area constrained, positional constrained, and packing into an irregular area, and packing of cubes into a 3-dimensional space.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	placement / packing / critical-path / BSG / Sequence-Pair
Paper #	VLD98-38,ICD98-141,CPSY98-75,FTS98-65
Date of Issue

Conference Information
Committee	VLD
Conference Date	1998/9/21(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)	On Packing of Rectangles into a Small Plane Area
Sub Title (in English)
Keyword(1)	placement
Keyword(2)	packing
Keyword(3)	critical-path
Keyword(4)	BSG
Keyword(5)	Sequence-Pair
1st Author's Name	Yoji KAJITANI
1st Author's Affiliation	Dept. of Electrical and Electronic Engrg., Tokyo Institute of Technology()
Date	1998/9/21
Paper #	VLD98-38,ICD98-141,CPSY98-75,FTS98-65
Volume (vol)	vol.98
Number (no)	286
Page	pp.pp.-
#Pages	8
Date of Issue