The layer number of grids

Authors Gergely Ambrus, Alexander Hsu, Bo Peng, Shiyu Jan

Publication date 28 September 2020

Convex sets without dimension restrictions (aspects of convex geometry) (52A05) Combinatorial complexity of geometric structures (52C45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: The peeling process is defined as follows: starting with a finite point set

X s u b s e t m a t h b b 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 g e q 1

, the layer number of

[n]^{d}

is at least

O m e g a l e f t (n^{f} r a c 2 d d + 1 i g h t)

. On the other hand, we show that for every

d g e q 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'{y} for solving the 2-dimensional case.

This page was built for publication: The layer number of grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6350009)