Beldiceanu, Nicolas and Carlsson, Mats (2001) Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint. In: Principles and Practice of Constraint Programming (CP 2001): 7th International Conference, 26 Nov - 1 Dec 2001, Paphos, Cyprus.
Full text not available from this repository.
Official URL: http://www.springerlink.com/content/6g90qhwgblwuka...
We first present a generic pruning technique, which aggregates several constraints sharing some variables. The method is derived from an idea called 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 specialise this technique to the non-overlapping rectangles constraint, describe several optimisations, and give an empirical evaluation based on six sets of test instances with different characteristics.
|Item Type:||Conference or Workshop Item (Paper)|
|Additional Information:||Lecture notes in computer science; 2239. DOI 10.1007/3-540-45578-7_26. Preprint available as SICS Technical Report T2001-13.|
|Deposited By:||Dominique Johansson|
|Deposited On:||07 Aug 2008|
|Last Modified:||18 Nov 2009 16:17|
Repository Staff Only: item control page