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

翻译：我们显示,有金刚金币,有P美元和Q美元,因此Minkowski 数额最大的金刚多边形的美元(P$)的大小为$@theta(n\log n) 。这与Tiwary的上限相符。