A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation

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 represented by a set of equidistant vertical line segments. The discretization algorithm uses a sweep-line method and applies min...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2021-08
Hauptverfasser:	Chehrazad, Sahar, Roose, Dirk, Wauters, Tony
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Data structures Nesting Placement Representations Segments Strip
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!