Extending the centerpoint theorem to multiple points

10/24/2018
by   Alexander Pilz, et al.
0

The centerpoint theorem is a well-known and widely used result in discrete geometry. It states that for any point set P of n points in R^d, there is a point c, not necessarily from P, such that each halfspace containing c contains at least n/d+1 points of P. Such a point c is called a centerpoint, and it can be viewed as a generalization of a median to higher dimensions. In other words, a centerpoint can be interpreted as a good representative for the point set P. But what if we allow more than one representative? For example in one-dimensional data sets, often certain quantiles are chosen as representatives instead of the median. We present a possible extension of the concept of quantiles to higher dimensions. The idea is to find a set Q of (few) points such that every halfspace that contains one point of Q contains a large fraction of the points of P and every halfspace that contains more of Q contains an even larger fraction of P. This setting is comparable to the well-studied concepts of weak ε-nets and weak ε-approximations, where it is stronger than the former but weaker than the latter.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/26/2021

Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions

Given a finite point set P in ℝ^d, and ϵ>0 we say that N⊆ℝ^d is a weak ϵ...
research
05/18/2021

A SAT attack on higher dimensional Erdős–Szekeres numbers

A famous result by Erdős and Szekeres (1935) asserts that, for every k,d...
research
07/17/2020

On convex holes in d-dimensional point sets

Given a finite set A ⊆ℝ^d, points a_1,a_2,…,a_ℓ∈ A form an ℓ-hole in A i...
research
03/07/2023

An extension theorem for signotopes

In 1926, Levi showed that, for every pseudoline arrangement 𝒜 and two po...
research
05/22/2018

Aperiodic points in Z^2-subshifts

We consider the structure of aperiodic points in Z^2-subshifts, and in ...
research
12/07/2018

Approximate Calculation of Tukey's Depth and Median With High-dimensional Data

We present a new fast approximate algorithm for Tukey (halfspace) depth ...
research
07/12/2019

On circles enclosing many points

We prove that every set of n red and n blue points in the plane contains...

Please sign up or login with your details

Forgot password? Click here to reset