当前位置:
X-MOL 学术
›
Discret. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Convexly independent subsets of Minkowski sums of convex polygons
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-05-26 , DOI: 10.1016/j.disc.2021.112472 Mateusz Skomra , Stéphan Thomassé
中文翻译:
凸多边形的Minkowski和的凸独立子集
更新日期:2021-05-26
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-05-26 , DOI: 10.1016/j.disc.2021.112472 Mateusz Skomra , Stéphan Thomassé
We show that there exist convex n-gons P and Q such that the largest convex polygon in the Minkowski sum has size . This matches an upper bound of Tiwary.
中文翻译:
凸多边形的Minkowski和的凸独立子集
我们证明存在凸n边形P和Q,使得Minkowski和中最大的凸多边形 有大小 。这与Tiwary的上限匹配。