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

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.