Description
Abstract: To peel a finite point set in Euclidean space, remove the vertices of its convex hull. The number of times a point set must be peeled to remove all of its vertices is called the layer number of the set. After outlining previous work on random point sets and "evenly distributed" point sets, I will turn to the grid {1,2,...,n}^d, whose layer number remains unknown. The central results of this talk are two short proofs that significantly improve the bounds for the layer number of grids. We show as a consequence that the layer number of grids is linear in d.