A robust procedure for obtaining the nofit polygon using Minkowski sums
Julia A. Bennell, Xiang Song
Abstract
Julia A. Bennell, Xiang Song
Abstract
The nofit polygon is a powerful tool for handling the geometry of nesting problems. A procedure using the mathematical concept of Minkowski sums for calculating the nofit polygon is presented. It is more efficient and reliable than other Minkowski Sum approaches. Computational experience shows that it is general and accessible.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The nofit polygon is a powerful tool for handling the geometry of nesting problems. A procedure using the mathematical concept of Minkowski sums for calculating the nofit polygon is presented. It is more efficient and reliable than other Minkowski Sum approaches. Computational experience shows that it is general and accessible.
Key concepts: Polygon (computer graphics), Minkowski space, Minkowski addition, Mathematics, Point in polygon, Geometry of numbers, Rectilinear polygon, Computer science