首页> 外文期刊>Electronic Journal Of Combinatorics >A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets
【24h】

A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets

机译:平面点集的Minkowski和的凸独立子集的紧下界

获取原文
           

摘要

Recently, Eisenbrand, Pach, Rothvo?, and Sopher studied the function $M(m, n)$, which is the largest cardinality of a convexly independent subset of the Minkowski sum of some planar point sets $P$ and $Q$ with $|P| = m$ and $|Q| = n$. They proved that $M(m,n)=O(m^{2/3}n^{2/3}+m+n)$, and asked whether a superlinear lower bound exists for $M(n,n)$. In this note, we show that their upper bound is the best possible apart from constant factors.
机译:最近,Eisenbrand,Pach,Rothvo?和Sopher研究了函数$ M(m,n)$,这是一些平面点集$ P $和$ Q $的Minkowski和的凸独立子集的最大基数,其中$ | P | = m $和$ | Q | = n $。他们证明$ M(m,n)= O(m ^ {2/3} n ^ {2/3} + m + n)$,并询问$ M(n,n)是否存在超线性下界$。在此注释中,我们显示了除恒定因素外,它们的上限是最好的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号