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.ISSN:1868-896
We generalize the Tukey depth to use cones instead of halfspaces. We prove a generalization of the c...
We present an algorithm for computing the discrete 2-center of a set P of n points in the plane; th...
In 2008, Bukh, Matoušek, and Nivasch conjectured that for every n-point set S in ℝd and every k, 0 ≤...
The centerpoint theorem is a well-known and widely used result in discrete geometry. It states that ...
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plan...
AbstractUsing a technique that Tverberg and Vrecica (1993) [16] discovered to give a surprisingly si...
GeneralThe Centerpoint Theorem states that, for any set S of n points in R(d), there exists a point ...
AbstractWe prove an optimal extension of the centerpoint theorem: given a set P of n points in the p...
International audienceIn this paper, we introduce the notion of k-centerpoints for any set P of n po...
The Centerpoint Theorem states that for any set $S$ of points in $\mathbb{R}^d$, there exists a poin...
Let P be a set of n points in R-d and F be a family of geometric objects. We call a point x is an el...
Let P be a set of n points in R-d. A point x is said to be a centerpoint of P if x is contained in e...
In this article, I present an unusual proof of the Centroid Theorem. (The theorem states: For any t...
We revisit an algorithm of Clarkson et al. [K. L. Clarkson et al., 1996], that computes (roughly) a ...
We introduce a concept that generalizes several different notions of a “centerpoint” in the literatu...
We generalize the Tukey depth to use cones instead of halfspaces. We prove a generalization of the c...
We present an algorithm for computing the discrete 2-center of a set P of n points in the plane; th...
In 2008, Bukh, Matoušek, and Nivasch conjectured that for every n-point set S in ℝd and every k, 0 ≤...
The centerpoint theorem is a well-known and widely used result in discrete geometry. It states that ...
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plan...
AbstractUsing a technique that Tverberg and Vrecica (1993) [16] discovered to give a surprisingly si...
GeneralThe Centerpoint Theorem states that, for any set S of n points in R(d), there exists a point ...
AbstractWe prove an optimal extension of the centerpoint theorem: given a set P of n points in the p...
International audienceIn this paper, we introduce the notion of k-centerpoints for any set P of n po...
The Centerpoint Theorem states that for any set $S$ of points in $\mathbb{R}^d$, there exists a poin...
Let P be a set of n points in R-d and F be a family of geometric objects. We call a point x is an el...
Let P be a set of n points in R-d. A point x is said to be a centerpoint of P if x is contained in e...
In this article, I present an unusual proof of the Centroid Theorem. (The theorem states: For any t...
We revisit an algorithm of Clarkson et al. [K. L. Clarkson et al., 1996], that computes (roughly) a ...
We introduce a concept that generalizes several different notions of a “centerpoint” in the literatu...
We generalize the Tukey depth to use cones instead of halfspaces. We prove a generalization of the c...
We present an algorithm for computing the discrete 2-center of a set P of n points in the plane; th...
In 2008, Bukh, Matoušek, and Nivasch conjectured that for every n-point set S in ℝd and every k, 0 ≤...