Change search
ReferencesLink to record
Permanent link

Direct link
Sweep as a Generic Pruning Technique Applied to the Non-Overlapping Rectangles Constraint
Number of Authors: 2
2001 (English)Report (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 2001, 1. , 17 p.
SICS Technical Report, ISSN 1100-3154 ; 2001:13
Keyword [en]
Constraint Programming, Global Constraint, Sweep, Non-Overlapping
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-22106OAI: diva2:1041648
Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(295 kB)2 downloads
File information
File name FULLTEXT01.pdfFile size 295 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 2 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 1 hits
ReferencesLink to record
Permanent link

Direct link