Two-dimensional (2D) irregular packing problems are widespread in manufacturing
industries such as shipbuilding, metalworking, automotive production, aerospace, clothing …

The irregular strip-packing problem, also known as nesting or marker making, is defined as
the automatic computation of a non-overlapping placement of a set of non-convex polygons …

Background: The Irregular Strip Packing Problem (ISPP) involves packing a set of irregularly
shaped items within a strip while minimizing its length. Methods: This study introduces the …

We present a fast algorithm to solve nesting problems based on a semi-discrete
representation of both the 2D non-convex pieces and the strip. The pieces and the strip are …

In the field of the operational research, the cutting & packing problems are one of the most
significant studied subjects. Among these problems, bi-dimensional irregular packing …

The bi-dimensional irregular strip packing is a difficult problem in the cutting and packing
field. Its main feature, and central source of complexity, is the irregularity of the shape of the …

In this work, we propose a heuristic to solve two-dimensional cutting and packing problems
using a raster representation of shapes and container. We use discrete mathematical …

The irregular strip-packing problem, also known as nesting or marker making, is defined as
the automatic computation of a non-overlapping placement of a set of non-convex polygons …

In the field of robotic manipulation, a fully automatic object fulfillment is an important issue in
applications not only for high-density warehouse optimization but also for agricultural …

Abstract Mathematics is closely related to people's daily lives, such as the various shapes
that can be seen everywhere, and the various distance relationships. Similarly, industrial …