Skip to main content
Log in

Covering a polygonal region by rectangles

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

The problem of covering a compact polygonal region, called target region, with a finite family of rectangles is considered. Tools for mathematical modeling of the problem are provided. Especially, a function, called Γ-function, is introduced which indicates whether the rectangles with respect to their configuration form a cover of the target region or not. The construction of the Γ-function is similar to that of Φ-functions which have been proved to be an efficient tool for packing problems. A mathematical model of the covering problem based on the Γ-function is proposed as well as a solution strategy. The approach is illustrated by an example and some computational results are presented.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bennell, J., Scheithauer, G., Stoyan, Y., Romanova, T.: Tools of mathematical modeling of arbitrary object packing problems. Ann. Oper. Res. (2008). ISSN 0254-5330 (Print) 1572-9338 (Online)

  2. Daniels, K., Inkulu, R.: An incremental algorithm for translational polygon covering. Technical Report, 2001-001, University of Massachusetts at Lowell Computer Science

  3. Dyckhoff, H., Scheithauer, G., Terno, J.: Cutting and packing. In: Dell’Amico, M., Maffioli, F. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 393–412. Wiley, New York (1997)

    Google Scholar 

  4. Fowler, R., Paterson, M., Tanimoto, L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12(3), 133–137 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  5. Stoyan, Y.G.: Covering a polygonal region by a collection of various size rectangles. Mech. Eng. Probl. 10(2), 67–82 (2007)

    Google Scholar 

  6. Stoyan, Y.G., Patsuk, V.: Covering a convex polygon with the given number of equal circles of minimal radius. Comput. Optim. Appl. (2008). Online

  7. Stoyan, Y.G., Terno, J., Schithauer, G., Gil, N., Romanova, T.: Φ-function for 2D primary objects. Stud. Inform. (Paris Univ.) 2(1), 1–32 (2002)

    Google Scholar 

  8. Stoyan, Y.G., Scheithauer, G., Gil, N., Romanova, T.: Φ-function for complex 2D objects. 4OR (Q. J. Belg. Fr. Italian Oper. Res. Soc.) 2(1), 69–84 (2004)

    MATH  MathSciNet  Google Scholar 

  9. Stoyan, Y.G., Gil, N., Scheithauer, G., Pankratov, A., Magdalina, I.: Packing of convex polytopes into a parallelepiped. Optimization 54(2), 215–236 (2005)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to G. Scheithauer.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stoyan, Y.G., Romanova, T., Scheithauer, G. et al. Covering a polygonal region by rectangles. Comput Optim Appl 48, 675–695 (2011). https://doi.org/10.1007/s10589-009-9258-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-009-9258-1

Keywords

Navigation