网格层数
The layer number of grids
摘要:
剥离过程定义如下:从有限点集$X \subset \mathbb{R}^d$开始,我们反复移除当前点集的凸包的顶点集。完全删除集合$X$所需的剥离步骤的数量被称为$X$的层号。本文研究了$d$维整数网格$[n]^d$的层数.我们证明了对于每个$d \geq 1$,$[n]^d$的层数至少是$Ω\left(n^\frac{2d}{d+1}\right)$。另一方面,我们表明,对于每一个$d\geq 3$,它需要在最多$O(n^{d - 9/11})$步骤,以完全删除$[n]^d$。我们的方法是基于一个增强的方法,用于解决2维的情况下,由哈Peled和Lidickelton。
英文摘要:
The peeling process is defined as follows: starting with a finite point set $X \subset \mathbb{R}^d$, we repeatedly remove the set of vertices of the convex hull of the current set of points. The number of peeling steps needed to completely delete the set $X$ is called the layer number of $X$. In this paper, we study the layer number of the $d$-dimensional integer grid $[n]^d$. We prove that for every $d \geq 1$, the layer number of $[n]^d$ is at least $Ω\left(n^\frac{2d}{d+1}\right)$. On the other hand, we show that for every $d\geq 3$, it takes at most $O(n^{d - 9/11})$ steps to fully remove $[n]^d$. Our approach is based on an enhancement of the method used by Har-Peled and Lidický for solving the 2-dimensional case.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。