Convexly independent subsets of Minkowski sums of convex polygons
share
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 n). This matches an upper bound of Tiwary.
READ FULL TEXTWe 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 n). This matches an upper bound of Tiwary.
READ FULL TEXT