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

  • Nicolas Beldiceanu
  • Mats Carlsson
Conference paper

DOI: 10.1007/3-540-45578-7_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2239)
Cite this paper as:
Beldiceanu N., Carlsson M. (2001) Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint. In: Walsh T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg

Abstract

We first presen ta 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 to several families of global constraints. A second advantage is that it does not lead to any memory consumption problem since it only requires temporary memory which 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 with different characteristics.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Nicolas Beldiceanu
    • 1
  • Mats Carlsson
    • 1
  1. 1.SICSUPPSALASweden

Personalised recommendations