Advertisement

Subtraction of Two 2D Polygons with Some Matching Vertices

  • Georgi Evtimov
  • Stefka FidanovaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11189)

Abstract

Cutting Stock Problem (CSP) is an important industrial problem. In this paper we focus on the variant arising in building construction, where a set of plates needs to be cut from rectangular stock, minimizing the waste. The CSP is known to be NP-hard combinatorial problem. The goal of this work is to propose an efficient way for subtracting of two polygons with some matching vertices.

Notes

Acknowledgment

The work presented here is partially supported by the Bulgarian National Research Fund under Grants DFNI DN 12/5 and DFNI DN 02/10.

References

  1. 1.
    Alvarez-Valdes, R., Parajon, A., Tamarit, J.M.: A computational study of heuristic algorithms for two-dimensional cutting stock problems. In: 4th Metaheuristics International Conference (MIC 2001), pp. 16–20 (2001)Google Scholar
  2. 2.
    Alvarez-Valdes, R., Parreno, F., Tamarit, J.M.: A Tabu Search algorithm for two dimensional non-guillotine cutting problems. Eur. J. Oper. Res. 183(3), 1167–1182 (2007)CrossRefGoogle Scholar
  3. 3.
    Cintra, G., Miyazawa, F., Wakabayashi, Y., Xavier, E.: Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. Eur. J. Oper. Res. 191, 61–85 (2008)CrossRefGoogle Scholar
  4. 4.
    Dusberger, F., Raidl, G.R.: A variable neighborhood search using very large neighborhood structures for the 3-staged 2-dimensional cutting stock problem. In: Blesa, M.J., Blum, C., Voß, S. (eds.) HM 2014. LNCS, vol. 8457, pp. 85–99. Springer, Cham (2014).  https://doi.org/10.1007/978-3-319-07644-7_7CrossRefGoogle Scholar
  5. 5.
    Dusberger, F., Raidl, G.R.: Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search. Electron. Notes Discrete Math. 47, 133–140 (2015)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Evtimov, G., Fidanova, S.: Heuristic algorithm for 2D cutting stock problem. In: Lirkov, I., Margenov, S. (eds.) LSSC 2017. LNCS, vol. 10665, pp. 350–357. Springer, Cham (2018).  https://doi.org/10.1007/978-3-319-73441-5_37CrossRefGoogle Scholar
  7. 7.
    Gonçalves, J.F.: A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem. Eur. J. Oper. Res. 183(3), 1212–1229 (2007)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Parmar, K., Prajapati, H., Dabhi, V.: Cutting stock problem: a survey of evolutionary computing based solution. In: Proceedings of Green Computing Communication and Electrical Engineering (2014).  https://doi.org/10.1109/ICGCCEE.2014.6921411
  9. 9.
    Lodi, A., Martello, S., Vigo, D.: Recent advances on two-dimensional bin packing problems. Discrete Appl. Math. 123, 379–396 (2002)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Lin, Z., Li, Y.: An efficient algorithm for intersection, union and difference between two polygons. In: Proceedings of Computer Network and Multimedia Technology, Wuhan, China, pp. 1–4 (2009)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Institute of Information and Communication Technologies, Bulgarian Academy of SciencesSofiaBulgaria

Personalised recommendations