Bi-dimensional Domains for the Non-overlapping Rectangles Constraint

摘要

Given a set of rectangles and a bi-dimensional container, the non-overlapping rectangles constraint aims to obtain consistency such that all the rectangles can be placed without intersection inside the box. So, the nonOverlapping([R_1..., R_n],Box) holds iff all rectangles are placed inside the Box and no two rectangles R_j and R_j overlap.rnThe n dimensional version of this constraint, called diffn [1], has been used in many applications. In the context of two dimensions, it has an obviously prominent role in various flavors of placement problems (such as 2-dim packing and cutting problems) and scheduling problems to model resource constraints [2].