在接近线性的时间内接近最佳的土豆去皮
Peeling potatoes near-optimally in near-linear time
摘要:
本文考虑如下几何优化问题:求一个包含在给定的具有$n$顶点的简单多边形$P$中的面积最大的凸多边形。我们给出了一个随机的近线性时间$(1-\varepsilon)$近似算法:在$O(n( \log^2 n + (1/\varepsilon^3) \log n + 1/\varepsilon^4))$时间,我们找到一个凸多边形包含在$P$,概率至少$2/3$,面积至少$(1-\varepsilon)$倍的最优解的面积。我们也得到了类似的结果计算$P$内的凸多边形的最大周长的变体。为了实现这些结果,我们提供了新的几何概率的结果。第一个结果是与$P$内随机均匀选择的两个点相互可见的概率和$P$内最大凸体的面积相关的界限。第二个结果是任何平面凸体$K$的周长与$K$内部均匀随机样本的凸包的周长之间的差的期望值的界限。
英文摘要:
We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon $P$ with $n$ vertices. We give a randomized near-linear-time $(1-\varepsilon)$-approximation algorithm for this problem: in $O(n( \log^2 n + (1/\varepsilon^3) \log n + 1/\varepsilon^4))$ time we find a convex polygon contained in $P$ that, with probability at least $2/3$, has area at least $(1-\varepsilon)$ times the area of an optimal solution. We also obtain similar results for the variant of computing a convex polygon inside $P$ with maximum perimeter. To achieve these results we provide new results in geometric probability. The first result is a bound relating the probability that two points chosen uniformly at random inside $P$ are mutually visible and the area of the largest convex body inside $P$. The second result is a bound on the expected value of the difference between the perimeter of any planar convex body $K$ and the perimeter of the convex hull of a uniform random sample inside $K$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。