By Topic

Arbitrary convex and concave rectilinear block packing based on O-Tree representation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fujiyioshi, K. ; Tokyo Univ. of Agric. & Technol., Tokyo ; Ukibe, H.

In this paper, we propose an improved method to represent rectilinear block packing based on O-Tree representation. Also, we propose a decoding algorithm to obtain a rectilinear block packing in O((c+1)n) time, where n and c are the number of rectangular sub-blocks and concave blocks respectively. Note that the proposed algorithm requires only O(n) time when c is constant, which is equal to the trivial lower bound of time complexity for decoding. The effectiveness of the proposed method was confirmed by the experimental comparisons.

Published in:

Circuits and Systems, 2008. APCCAS 2008. IEEE Asia Pacific Conference on

Date of Conference:

Nov. 30 2008-Dec. 3 2008