Subtraction of Two 2D Polygons with Some Matching Vertices
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.
The work presented here is partially supported by the Bulgarian National Research Fund under Grants DFNI DN 12/5 and DFNI DN 02/10.
- 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
- 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
- 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
- 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