arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.0443cs.CG
收藏

各种几何对象的选择引理

Selection Lemmas for various geometric objects

Pradeesha Ashok, Ninad Rajgopal, Sathish Govindarajan

摘要:

选择引理是离散几何中的经典结果,在弱三角网和瘦身德洛内三角剖分等几何问题中有着广泛的应用。选择引理类型的结果通常表明,存在一个点,该点包含在由基础点集诱导(跨越)的许多对象中。在第一个选择引理中,我们考虑由点集$P$诱导(跨越)的所有对象的集合。这个问题在$\mathbb{R}^d$中的单纯形中得到了广泛的探讨,在$\mathbb{R}^2$中有紧边界。在本文中,我们证明了其他类别的几何对象的第一选择引理。我们还考虑了这个问题的强变体,其中我们添加了穿透点来自$P$的约束。我们证明了一个确切的结果上的强和弱变种的第一选择引理轴平行矩形,特殊子类的轴平行矩形像象限和板,磁盘(中心对称点集)。我们还显示了非平凡的界限上的第一选择引理轴平行盒和超球$\mathbb{R}^d$。在第二个选择引理中,我们考虑由$P$诱导的所有对象的集合的任意$m$大小的子集。我们研究这个问题的轴平行矩形,并表明,存在一个点在平面上,包含在$\frac{m^3}{24n^4}$矩形。当$m$几乎是二次的时候,这是对Smorodinsky和Sharir以前的界限的改进。

英文摘要:

Selection lemmas are classical results in discrete geometry that have been well studied and have applications in many geometric problems like weak epsilon nets and slimming Delaunay triangulations. Selection lemma type results typically show that there exists a point that is contained in many objects that are induced (spanned) by an underlying point set. In the first selection lemma, we consider the set of all the objects induced (spanned) by a point set $P$. This question has been widely explored for simplices in $\mathbb{R}^d$, with tight bounds in $\mathbb{R}^2$. In our paper, we prove first selection lemma for other classes of geometric objects. We also consider the strong variant of this problem where we add the constraint that the piercing point comes from $P$. We prove an exact result on the strong and the weak variant of the first selection lemma for axis-parallel rectangles, special subclasses of axis-parallel rectangles like quadrants and slabs, disks (for centrally symmetric point sets). We also show non-trivial bounds on the first selection lemma for axis-parallel boxes and hyperspheres in $\mathbb{R}^d$. In the second selection lemma, we consider an arbitrary $m$ sized subset of the set of all objects induced by $P$. We study this problem for axis-parallel rectangles and show that there exists an point in the plane that is contained in $\frac{m^3}{24n^4}$ rectangles. This is an improvement over the previous bound by Smorodinsky and Sharir when $m$ is almost quadratic.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑