Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition (Q3712146)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition |
scientific article |
Statements
Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition (English)
0 references
1983
0 references
cutting stock
0 references
circumscribing a convex polygon by a polygon of
0 references
fewer sides
0 references
minimal area addition
0 references
algorithm
0 references
efficient nesting of arbitrary geometric shapes
0 references
rectangular board
0 references
triangle rotating side problem
0 references
