Revising hull and box consistency
Proceedings of the 1999 international conference on Logic programming
An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Constraints-driven scheduling and resource assignment
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Sweep synchronization as a global propagation mechanism
Computers and Operations Research
A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Six Ways of Integrating Symmetries within Non-overlapping Constraints
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Filtering numerical CSPs using well-constrained subsystems
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
| Hi-index | 0.00 |
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.