Convexly independent subsets of Minkowski sums of convex polygons

03/27/2019
by   Mateusz Skomra, et al.
0

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 TEXT

Please sign up or login with your details

Forgot password? Click here to reset