Presentation 2007-11-22
Improved Method of Rectilinear Block Packing Based on O-Tree Representation
Hidehiko UKIBE, Kunihiro FUJIYOSHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we propose an improved method to represent rectilinear block packing based on an expanded O-Tree. Here, each rectilinear block is partitioned into rectangle sub-blocks. Also, we propose a decode algorithm to obtain a rectilinear block packing in O((c+1)n) time, where n and c each is the number of rectangle sub-blocks and concave blocks. The proposed algorithm requires O(n) time if c is constant. The effectiveness of the proposed method was confirmed by the experimental comparison.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) O-Tree / rectilinear block / packing / convex block / concave block
Paper # VLD2007-96,DC2007-51
Date of Issue

Conference Information
Committee DC
Conference Date 2007/11/15(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 Dependable Computing (DC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Improved Method of Rectilinear Block Packing Based on O-Tree Representation
Sub Title (in English)
Keyword(1) O-Tree
Keyword(2) rectilinear block
Keyword(3) packing
Keyword(4) convex block
Keyword(5) concave block
1st Author's Name Hidehiko UKIBE
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 University of Agriculture & Technology
Date 2007-11-22
Paper # VLD2007-96,DC2007-51
Volume (vol) vol.107
Number (no) 339
Page pp.pp.-
#Pages 6
Date of Issue