Minimum area circumscribing polygons (Q1822239)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum area circumscribing polygons |
scientific article |
Statements
Minimum area circumscribing polygons (English)
0 references
1985
0 references
We show that the smallest k-gon circumscribing a convex n-gon can be computed in \(O(n^ 2\log n \log k)\) time.
0 references
computational geometry
0 references
geometric algorithms
0 references
convex polygon
0 references
optimization
0 references
