arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1812.01595cs.CG
收藏

从轮集上的无交叉图到包含单形和少顶点多面体

From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices

Alexander Pilz, Emo Welzl, Manuel Wettstein

摘要:

如果除了$w$以外的所有点都是极值点,则在平面中处于一般位置的$n+1$点的集合$P = H \cup \{w\}$称为轮集。我们表明,为了计数交叉自由的几何图形在这样一个集合$P$,它足以知道的频率向量的$P$。虽然大致存在对应于轮组的$2^n$不同阶次类型,但频率向量的数量仅约为$2^{n/2}$。我们给出了简单的公式,在频率向量的交叉自由的生成循环,匹配,三角剖分,和更多的数量。在此基础上,可以有效地计算相应的图的数量。特别是,我们重新发现了一个已知的公式$w$ -拥抱三角形跨越$H$。同样在更高的维度中,轮组被证明是一个合适的模型来处理计算集合$H$中的点$w$的单纯深度的问题,即,包含$w$的单形的数目。虽然我们以前的参数在飞机上不容易推广,我们展示了如何使用类似的想法在$\mathbb{R}^d$的任何固定的$d$。其结果是一个$O(n^{d-1})$时间算法,用于计算$n$点的$H$集合中的点$w$的单纯深度,改进了以前的最佳界$O(n^d\log n)$。基于我们关于单纯形深度的结果,我们可以计算$\mathbb{R}^d$中一般位置的$n=d+k$点在时间$O(n^{\max\{ω,k-2\}})$上的凸包的面数,其中$ω\approx 2.373$,即使面的渐近数可能与$n^k$一样大.

英文摘要:

A set $P = H \cup \{w\}$ of $n+1$ points in general position in the plane is called a wheel set if all points but $w$ are extreme. We show that for the purpose of counting crossing-free geometric graphs on such a set $P$, it suffices to know the frequency vector of $P$. While there are roughly $2^n$ distinct order types that correspond to wheel sets, the number of frequency vectors is only about $2^{n/2}$. We give simple formulas in terms of the frequency vector for the number of crossing-free spanning cycles, matchings, triangulations, and many more. Based on that, the corresponding numbers of graphs can be computed efficiently. In particular, we rediscover an already known formula for $w$-embracing triangles spanned by $H$. Also in higher dimensions, wheel sets turn out to be a suitable model to approach the problem of computing the simplicial depth of a point $w$ in a set $H$, i.e., the number of $w$-embracing simplices. While our previous arguments in the plane do not generalize easily, we show how to use similar ideas in $\mathbb{R}^d$ for any fixed $d$. The result is an $O(n^{d-1})$ time algorithm for computing the simplicial depth of a point $w$ in a set $H$ of $n$ points, improving on the previously best bound of $O(n^d\log n)$. Based on our result about simplicial depth, we can compute the number of facets of the convex hull of $n=d+k$ points in general position in $\mathbb{R}^d$ in time $O(n^{\max\{ω,k-2\}})$ where $ω\approx 2.373$, even though the asymptotic number of facets may be as large as $n^k$.

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

↑