Skip to main content
Log in

Decomposition algorithm for geometric objects in 2D packing and cutting problems

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A class of basic 2D objects is introduced whose Φ-functions are known, and the decomposition theorem is proved for arbitrary φ-objects whose boundaries are formed by circular arcs and line segments. A step-by-step decomposition algorithm is proposed for arbitrary two-dimensional φ-objects. The algorithm efficiently constructs Φ-functions of arbitrary φ-objects in mathematical and computer modeling of packing and cutting problems. Results of numerical experiments 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.

Similar content being viewed by others

References

  1. H. Dyckhoff, G. Scheithauer, and J. Terno, “Cutting and packing,” in: M. Dell’Amico, F. Maffioli, and S. Martello (eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester (1997), pp. 393–412.

    Google Scholar 

  2. J. A. Bennell and J. F. Oliveira, “A tutorial in nesting problem: The geometry,” European J. Oper. Res. Invited Review, 184, 397–415 (2008).

    Article  MathSciNet  MATH  Google Scholar 

  3. E. Burke, R. Heller, G. Kendall, and G. Whitwell, “A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem,” Operational Research, 54, No. 3, 587–601 (2006).

    MATH  Google Scholar 

  4. L. V. Kantorovich and V. A. Zalgaller, Rational Cutting of Industrial Materials [in Russian], Nauka, Novosibirsk (1971).

    Google Scholar 

  5. Yu. G. Stoyan, “Φ-function and its basic properties,” Dop. NANU, No. 8, 112–117 (2001).

  6. Yu. Stoyan, M. Gil, M. Terno, T. Romanova, and G. Scheithauer, “Construction of a Φ-function for two convex polytopes,” Applicationes Mathematicae, 2, No. 29, 199–218 (2002).

    Article  MathSciNet  Google Scholar 

  7. J. Bennell, G. Scheithauer, Yu. Stoyan, and T. Romanova, “Tools of mathematical modeling of arbitrary object packing problems,” J. Annals of Operations Research, Springer, 179, No. 1, 343–368 (2010).

    MathSciNet  MATH  Google Scholar 

  8. Yu. Stoyan, G. Scheithauer, N. Gil, and T. Romanova, “Φ-functions for complex 2D objects,” 4OR: Quarterly J. Belgian, French, and Italian Operations Research Soc., 2, 69–84 (2004).

    MathSciNet  MATH  Google Scholar 

  9. Yu. Stoyan, J. Terno, G. Scheithauer, N. Gil, and T. Romanova, “Φ-functions for primary 2D objects,” Studia Informatica Universalis, 2, 1–32 (2001).

    Google Scholar 

  10. Yu. G. Stoyan and N. I. Gil’, Methods and Algorithms for Placement of Plane Geometric Objects [in Russian], Naukova Dumka, Kyiv (1976).

    Google Scholar 

  11. N. Chernov, Yu. Stoyan, and T. Romanova, “Mathematical model and efficient algorithms for object packing problem,” Computational Geometry: Theory and Applications, 43, 535–553 (2010), doi:10.1016/j.comgeo.2009.12.003.

    MathSciNet  MATH  Google Scholar 

  12. http://www.math.uab.edu/~chernov/CP.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. V. Zlotnik.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 28–37, November–December 2011.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stoyan, Y.G., Gil’, N.I., Romanova, T.E. et al. Decomposition algorithm for geometric objects in 2D packing and cutting problems. Cybern Syst Anal 47, 854–862 (2011). https://doi.org/10.1007/s10559-011-9364-9

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-011-9364-9

Keywords

Navigation