An O(n) algorithm to find a near-optimum partition of a convex polygon (Q3910015)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n) algorithm to find a near-optimum partition of a convex polygon |
scientific article |
Statements
An O(n) algorithm to find a near-optimum partition of a convex polygon (English)
0 references
1981
0 references
