Bi-dimensional Domains for the Non-overlapping Rectangles Constraint

Authors:
Fabio Parisini
Affiliations:
DEIS, University of Bologna, Bologna, Italy 40136
Venue:
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Year:
2008

Citing 2
Cited 0

The design and analysis of spatial data structures

The design and analysis of spatial data structures
Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.