Skip to main content
SpringerLink
Log in

Bi-dimensional Domains for the Non-overlapping Rectangles Constraint

  • Conference paper
Logic Programming (ICLP 2008)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5366))

Included in the following conference series:

  • 1151 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Mathl. Comput. Modelling 20(12), 97–123 (1994)

    Article  MATH  Google Scholar 

  2. Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems. Mathl. Comput. Modelling 17(7), 57–73 (1993)

    Article  Google Scholar 

  3. Hentenryck, P.V., Saraswat, V., Deville, Y.: Design, implementation and evaluation of the constraint language cc(fd). Constraints: Basic and Trends 910 (1995)

    Google Scholar 

  4. 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)

    Chapter  Google Scholar 

  5. Korf, R.E.: Optimal rectangle packing: New results. In: ICAPS 2004, pp. 142–149 (2004)

    Google Scholar 

  6. Moffitt, M.D., Pollack, M.E.: Optimal rectangle packing: A meta-csp approach. In: ICAPS 2006, pp. 93–102 (2006)

    Google Scholar 

  7. Simonis, H., Sullivan, B.O.: Using global constraints for rectangle packing. In: CP-AIOR (2008)

    Google Scholar 

  8. Samet, H.: The design and analisys of Spatial Data Structures. Addison-Wesley, Reading (1989)

    Google Scholar 

  9. Regin, J.: Global constraints and filtering algorithms. In: Milano, M. (ed.) Constraint and Integer Programming. Kluwer Academic Publisher, Dordrecht (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DEIS, University of Bologna, V.le Risorgimento 2, 40136, Bologna, Italy

    Fabio Parisini

Authors
  1. Fabio Parisini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Clayton School of Information Technology, Monash University, Australia

    Maria Garcia de la Banda

  2. Department of Computer Science, New Mexico State University, NM 88003, Las Cruces, USA

    Enrico Pontelli

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation