Convexly independent subsets of Minkowski sums of convex polygons

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 $\mathrm{\Theta }(n\log n)$. This matches an upper bound of Tiwary.