A new algorithm for the minimal-area convex enclosure problem (Q1127205)
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 new algorithm for the minimal-area convex enclosure problem |
scientific article; zbMATH DE number 1189571
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for the minimal-area convex enclosure problem |
scientific article; zbMATH DE number 1189571 |
Statements
A new algorithm for the minimal-area convex enclosure problem (English)
0 references
19 August 1999
0 references
computational geometry
0 references
manufacturing
0 references
nesting
0 references
irregular pattern layout
0 references
cutting
0 references
minimal-area convex enclosure problem
0 references
0 references
0.89207137
0 references
0.8885764
0 references
0.8873899
0 references
0.88580203
0 references
0.8831254
0 references
0 references
0.88189113
0 references
