Bi-dimensional Domains for the Non-overlapping Rectangles Constraint

LOGIC PROGRAMMING, PROCEEDINGS（2008）

引用 0|浏览0

暂无评分

摘要

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 i and R j overlap.

查看译文

关键词

r n,bi-dimensional container,non-overlapping rectangles constraint,rectangles r i,bi-dimensional domains

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要