Sweeping with Continuous Domains. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Sweeping with Continuous Domains.


The geost constraint has been proposed to model and solve discrete placement problems involving multi-dimensional boxes (packing in space and time). The filtering technique is based on a sweeping algorithm that requires the ability for each constraint to compute a forbidden box around a given fixed point and within a surrounding area. Several cases have been studied so far, including integer linear inequalities. Motivated by the placement of objects with curved shapes, this paper shows how to implement this service for continuous constraints with arbitrary mathematical expressions. The approach relies on symbolic processing and defines a new interval arithmetic.

Dates and versions

hal-00915701 , version 1 (09-12-2013)



Gilles Chabert, Nicolas Beldiceanu. Sweeping with Continuous Domains.. Principles and Practice of Constraint Programming - CP 2010, Oct 2010, St. Andrews, United Kingdom. pp.137-151, ⟨10.1007/978-3-642-15396-9_14⟩. ⟨hal-00915701⟩
136 View
0 Download



Gmail Facebook X LinkedIn More