By Topic

Arbitrary convex and concave rectilinear block packing based on corner block list

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

7 Author(s)
Yuchun Ma ; Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China ; Xianlong Hong ; Sheqin Dong ; Yici Cai
more authors

Based on the Corner Block List (CBL) structure, this paper proposed a novel method to represent rectilinear blocks, including arbitrary concave rectilinear blocks. Our idea is to use the sub-CBL to represent the collection of the sub-blocks of a rectilinear block. We devise the necessary and sufficient conditions for the feasible CBL with sub_CBL embedded. And additional distance constraints are applied to the concave rectilinear blocks such that non-overlapped packing of arbitrary rectilinear blocks can always be guaranteed. To avoid the infeasible CBL during the stochastic search, we devise the heuristic method to remedy the given CBL into a feasible one. Both the theoretical results and the experimental results show the effectiveness of our method.

Published in:

Circuits and Systems, 2003. ISCAS '03. Proceedings of the 2003 International Symposium on  (Volume:5 )

Date of Conference:

25-28 May 2003