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. © 2010 Springer-Verlag.
CITATION STYLE
Chabert, G., & Beldiceanu, N. (2010). Sweeping with continuous domains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6308 LNCS, pp. 137–151). Springer Verlag. https://doi.org/10.1007/978-3-642-15396-9_14
Mendeley helps you to discover research relevant for your work.