Implementing a Parallel Nesting Algorithm Using OpenMP

We consider the nesting problem with some restrictions, which is one of the cutting and packing problems. The nesting problem is defined as follows: given parts of the irregular shapes, find a layout such that the minimum bounding box of the layout is the smallest among all layouts with some restrictions. We propose a parallel nesting algorithm, and show experimental results through the multi-core CPU. Our implementation can efficiently generate training data for machine learning or deep learning.