Convexly independent subsets of Minkowski sums of convex polygons
Mateusz Skomra, Stéphan Thomassé·2019-03-27·via math.CO updates on arXiv.org
We show that there exist convex $n$-gons $P$ and $Q$ such that the largest convex polygon in the Minkowski sum $P+Q$ has size $Θ(n\log n)$. This matches an upper bound of Tiwary.
