Packing convex polygons in minimum-perimeter convex hulls (Q2679237)
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: Packing convex polygons in minimum-perimeter convex hulls |
scientific article; zbMATH DE number 7643838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing convex polygons in minimum-perimeter convex hulls |
scientific article; zbMATH DE number 7643838 |
Statements
Packing convex polygons in minimum-perimeter convex hulls (English)
0 references
19 January 2023
0 references
global optimization
0 references
non-convex nonlinear programming
0 references
polygon packing problem
0 references
convex hull
0 references
perimeter minimization
0 references
non-overlap constraints
0 references
computational geometry
0 references
0 references
0 references
0 references
0 references
0 references
0.8379481434822083
0 references
0.8212271928787231
0 references
0.8171040415763855
0 references
0.8131291270256042
0 references
