SODA

Sweep as a Generic Pruning Technique Applied to the Non-Overlapping Rectangles Constraint

Beldiceanu, Nicolas and Carlsson, Mats (2001) Sweep as a Generic Pruning Technique Applied to the Non-Overlapping Rectangles Constraint. [SICS Report]

[img]Postscript
144Kb
[img]
Preview
PDF
294Kb

Abstract

We first present a generic pruning technique which aggregates several constraints sharing some variables. The method is derived from an idea called \dfn{sweep} which is extensively used in computational geometry. A first benefit of this technique comes from the fact that it can be applied on several families of global constraints. A second main advantage is that it does not lead to any memory consumption problem since it only requires temporary memory that can be reclaimed after each invocation of the method. We then specialize this technique to the non-overlapping rectangles constraint, describe several optimizations, and give an empirical evaluation based on six sets of test instances of different pattern.

Item Type:SICS Report
Uncontrolled Keywords:Constraint Programming, Global Constraint, Sweep, Non-Overlapping
ID Code:2384
Deposited By:Vicki Carleson
Deposited On:30 Jul 2009
Last Modified:18 Nov 2009 16:08

Repository Staff Only: item control page