AI Chat AI Image Generator AI Video Text to Speech

Peeling Sequences

11/11/2022

∙

by Adrian Dumitrescu, et al.

∙

∙

Given an n-element point set in the plane, in how many ways can it be peeled off until no point remains? Only one extreme point can be removed at a time. The answer obviously depends on the point set. If the points are in convex position, there are exactly n! ways, which is the maximum number of ways for n points. But what is the minimum number?

page 1

page 2

page 3

page 4

research

∙ 11/24/2020

Realizing an m-uniform four-chromatic hypergraph with disks

We prove that for every m there is a finite point set 𝒫 in the plane suc...

0 Gábor Damásdi, et al. ∙

research

∙ 07/20/2020

Rainbow polygons for colored point sets in the plane

Given a colored point set in the plane, a perfect rainbow polygon is a s...

0 David Flores-Peñaloza, et al. ∙

research

∙ 05/21/2019

Lonely Points in Simplices

Given a lattice L in Z^m and a subset A of R^m, we say that a point in A...

0 Maximilian Jaroschek, et al. ∙

research

∙ 10/21/2022

Blocking Delaunay Triangulations from the Exterior

Given two distinct point sets P and Q in the plane, we say that Q blocks...

0 Oswin Aichholzer, et al. ∙

research

∙ 05/07/2018

Capturing points with a rotating polygon (and a 3D extension)

We study the problem of rotating a simple polygon to contain the maximum...

0 Carlos Alegría-Galicia, et al. ∙

research

∙ 07/27/2022

An optimal generalization of Alon and Füredi's covering result

Given an n-cube 𝒬^n := {0,1}^n in ℝ^n, the k-th layer 𝒬^n_k of 𝒬^n denot...

0 Arijit Ghosh, et al. ∙

research

∙ 03/30/2018

Delaunay Triangulations of Points on Circles

Delaunay triangulations of a point set in the Euclidean plane are ubiqui...

0 Vincent Despré, et al. ∙