GENERAL NESTING OF NON-CONVEX 2-D PARTS

摘要

This work presents an approach to reach a solution to the general problem of nesting irregular non-convex shape parts onto rectangular resources. The solution is obtained algorithmically, where several heuristics and computational techniques are used to get that. The algorithm is applied to nest 2D non-convex parts on rectangular resource and can be used in several industry activities as in paper industry, garment, and metals manufacturing.