Abstract
Given a set of rectangles and a bi-dimensional container, the non-overlapping rectangles constraint aims to obtain consistency such that all the rectangles can be placed without intersection inside the box. So, the nonOverlapping([R 1,...,R n ],Box) holds iff all rectangles are placed inside the Box and no two rectangles R i and R j overlap.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Mathl. Comput. Modelling 20(12), 97–123 (1994)
Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems. Mathl. Comput. Modelling 17(7), 57–73 (1993)
Hentenryck, P.V., Saraswat, V., Deville, Y.: Design, implementation and evaluation of the constraint language cc(fd). Constraints: Basic and Trends 910 (1995)
Beldiceanu, N., Carlsson, M.: Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 377–391. Springer, Heidelberg (2001)
Korf, R.E.: Optimal rectangle packing: New results. In: ICAPS 2004, pp. 142–149 (2004)
Moffitt, M.D., Pollack, M.E.: Optimal rectangle packing: A meta-csp approach. In: ICAPS 2006, pp. 93–102 (2006)
Simonis, H., Sullivan, B.O.: Using global constraints for rectangle packing. In: CP-AIOR (2008)
Samet, H.: The design and analisys of Spatial Data Structures. Addison-Wesley, Reading (1989)
Regin, J.: Global constraints and filtering algorithms. In: Milano, M. (ed.) Constraint and Integer Programming. Kluwer Academic Publisher, Dordrecht (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parisini, F. (2008). Bi-dimensional Domains for the Non-overlapping Rectangles Constraint. In: Garcia de la Banda, M., Pontelli, E. (eds) Logic Programming. ICLP 2008. Lecture Notes in Computer Science, vol 5366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89982-2_85
Download citation
DOI: https://doi.org/10.1007/978-3-540-89982-2_85
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89981-5
Online ISBN: 978-3-540-89982-2
eBook Packages: Computer ScienceComputer Science (R0)