Convexly independent subsets of Minkowski sums of convex polygons (Q2032897)
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: Convexly independent subsets of Minkowski sums of convex polygons |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convexly independent subsets of Minkowski sums of convex polygons |
scientific article |
Statements
Convexly independent subsets of Minkowski sums of convex polygons (English)
0 references
14 June 2021
0 references
The authors match a known upper bound in convex independent subsets theory, by proving that there exist convex \(n\)-gons \(P\) and \(Q\) such that the largest convex polygon in the Minkowski sum \(P + Q\) has size \(\mathcal O (n\log n)\).
0 references
Minkowski sum
0 references
convex embeddings of graphs
0 references
convexly independent sets
0 references
0 references
0.8692907094955444
0 references
0.8553789854049683
0 references
0.8441124558448792
0 references
0.8104459047317505
0 references
