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

逼近多面体组合复杂度的最优界

Optimal Bound on the Combinatorial Complexity of Approximating Polytopes

Rahul Arya, Sunil Arya, Guilherme D. da Fonseca, David M. Mount

摘要:

本文考虑如何用多面体简洁地逼近多维凸体的问题。给定欧氏$d$维空间中单位直径的凸体$K$(其中$d$为常数)和误差参数$\varepsilon > 0$,目标是确定一个低组合复杂度的凸多面体,其与$K$的Hausdorff距离至多为$\varepsilon$ .我们所说的组合复杂度是指所有维度的面的总数。Dudley和Bronshteyn/Ivanov的经典构造表明,$O(1/\varepsilon^{(d-1)/2})$面或顶点是可能的,但两者都不能同时达到两个边界。在本文中,我们表明,它是可能的,以$O(1/\varepsilon^{(d-1)/2})$组合复杂性,这是最佳的最坏的情况下,构造一个多面体。我们的结果是基于一个新的关系$\varepsilon$宽度帽的凸体和它的极体。利用这种关系,我们能够获得一个体积敏感的上限的数量近似帽是“本质上不同的。“我们实现了我们的主要结果相结合,这与一个变种的无收集器的方法和一个新的可变厚度分层结构的经济帽覆盖。

英文摘要:

This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body $K$ of unit diameter in Euclidean $d$-dimensional space (where $d$ is a constant) and an error parameter $\varepsilon > 0$, the objective is to determine a convex polytope of low combinatorial complexity whose Hausdorff distance from $K$ is at most $\varepsilon$. By combinatorial complexity we mean the total number of faces of all dimensions. Classical constructions by Dudley and Bronshteyn/Ivanov show that $O(1/\varepsilon^{(d-1)/2})$ facets or vertices are possible, respectively, but neither achieves both bounds simultaneously. In this paper, we show that it is possible to construct a polytope with $O(1/\varepsilon^{(d-1)/2})$ combinatorial complexity, which is optimal in the worst case. Our result is based on a new relationship between $\varepsilon$-width caps of a convex body and its polar body. Using this relationship, we are able to obtain a volume-sensitive bound on the number of approximating caps that are "essentially different." We achieve our main result by combining this with a variant of the witness-collector method and a novel variable-thickness layered construction of the economical cap covering.

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

↑