Solving nesting problems with non-convex polygons by constraint logic programming (Q4814103)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2097784
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving nesting problems with non-convex polygons by constraint logic programming |
scientific article; zbMATH DE number 2097784 |
Statements
Solving nesting problems with non-convex polygons by constraint logic programming (English)
0 references
7 September 2004
0 references
packing
0 references
nofit polygon
0 references
0.8579785227775574
0 references
0.7470858097076416
0 references
0.7367236614227295
0 references
0.735301673412323
0 references
0.7340909242630005
0 references
