A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation (Q2116899)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation |
scientific article |
Statements
A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation (English)
0 references
18 March 2022
0 references
cutting
0 references
nesting problems
0 references
semi-discrete representation
0 references
bottom-left-fill algorithm
0 references
sweep-line algorithm
0 references
0 references
0.8194884061813354
0 references
0.8158855438232422
0 references
0.801653265953064
0 references
0.801653265953064
0 references
0.7982683777809143
0 references
