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
Non-overlapping Constraints between Convex Polytopes
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A language for optimizing constraint propagation
A language for optimizing constraint propagation
A new constraint programming approach for the orthogonal packing problem
Computers and Operations Research
A new constraint solver for 3d lattices and its application to the protein folding problem
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Search Strategies for Rectangle Packing
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
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
New filtering for the cumulative constraint in the context of non-overlapping rectangles
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
A new graph-theoretical model for k-dimensional guillotine-cutting problems
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Sweeping with continuous domains
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A generic visualization platform for CP
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
A scalable sweep algorithm for the cumulative constraint
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A New Graph-Theoretical Model for the Guillotine-Cutting Problem
INFORMS Journal on Computing
Optimal rectangle packing: an absolute placement approach
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
This paper introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time constraints. The constraint kernel is generic in the sense that one of its parameters is a set of constraints on subsets of the objects. These constraints are handled globally by the kernel. We first illustrate how tomodel several placement problems with the constraint kernel. We then explain how new constraints can be introduced and plugged into the kernel. Based on these interfaces, we develop a generic k-dimensional lexicographic sweep algorithm for filtering the attributes of an object (i.e., its shape and the coordinates of its origin as well as its start, duration and end in time) according to all constraints where the object occurs. Experiments involving up to hundreds of thousands of objects and 1 million integer variables are provided in 2, 3 and 4 dimensions, both for simple shapes (i.e., rectangles, parallelepipeds) and for more complex shapes.