Minimum area circumscribing polygons (Q1822239)
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: Minimum area circumscribing polygons |
scientific article; zbMATH DE number 4001477
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum area circumscribing polygons |
scientific article; zbMATH DE number 4001477 |
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
0 references
0.9153228
0 references
0 references
0.9088102
0 references
0.9084107
0 references
0.90462756
0 references
0.90462756
0 references
0 references
0.89432496
0 references
