Convexly independent subsets of Minkowski sums of convex polygons
arXiv:1903.11287 · doi:10.1016/j.disc.2021.112472
Abstract
We show that there exist convex -gons and such that the largest convex polygon in the Minkowski sum has size . This matches an upper bound of Tiwary.
v1: 9 pages, 3 figures; v2: minor revision, 10 pages, 5 figures