International audienceIn this paper, we introduce the notion of k-centerpoints for any set P of n points in R^d. These unify and generalize previous results such as the classical centerpoint theorem, and the recently-proven ray-shooting theorem. We define two variants: affine k-centerpoints, and topological k-centerpoints. We prove their equivalence in R^2 , and conjecture that these are in fact equivalent in any dimension
The Centerpoint Theorem states that for any set $S$ of points in $\mathbb{R}^d$, there exists a poin...
We show that, for any set of n points in d dimensions, there exists a hyperplane with regression dep...
We prove that the maximum number of k-sets in a set S of n points in IR 3 is O(nk 3=2 ). This im...
International audienceIn this paper, we introduce the notion of k-centerpoints for any set P of n po...
The centerpoint theorem is a well-known and widely used result in discrete geometry. It states that ...
AbstractWe prove an optimal extension of the centerpoint theorem: given a set P of n points in the p...
AbstractUsing a technique that Tverberg and Vrecica (1993) [16] discovered to give a surprisingly si...
We revisit an algorithm of Clarkson et al. [K. L. Clarkson et al., 1996], that computes (roughly) a ...
In 2008, Bukh, Matoušek, and Nivasch conjectured that for every n-point set S in ℝd and every k, 0 ≤...
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...
GeneralThe Centerpoint Theorem states that, for any set S of n points in R(d), there exists a point ...
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plan...
At the core of successful manipulation and computation over large geometric data is the notion of ap...
We study the time complexity of the discrete k-center problem and related (exact) geometric set cove...
We study the parameterized complexity of the k-center problem on an given n-point set P in Rd, with ...
The Centerpoint Theorem states that for any set $S$ of points in $\mathbb{R}^d$, there exists a poin...
We show that, for any set of n points in d dimensions, there exists a hyperplane with regression dep...
We prove that the maximum number of k-sets in a set S of n points in IR 3 is O(nk 3=2 ). This im...
International audienceIn this paper, we introduce the notion of k-centerpoints for any set P of n po...
The centerpoint theorem is a well-known and widely used result in discrete geometry. It states that ...
AbstractWe prove an optimal extension of the centerpoint theorem: given a set P of n points in the p...
AbstractUsing a technique that Tverberg and Vrecica (1993) [16] discovered to give a surprisingly si...
We revisit an algorithm of Clarkson et al. [K. L. Clarkson et al., 1996], that computes (roughly) a ...
In 2008, Bukh, Matoušek, and Nivasch conjectured that for every n-point set S in ℝd and every k, 0 ≤...
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...
GeneralThe Centerpoint Theorem states that, for any set S of n points in R(d), there exists a point ...
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plan...
At the core of successful manipulation and computation over large geometric data is the notion of ap...
We study the time complexity of the discrete k-center problem and related (exact) geometric set cove...
We study the parameterized complexity of the k-center problem on an given n-point set P in Rd, with ...
The Centerpoint Theorem states that for any set $S$ of points in $\mathbb{R}^d$, there exists a poin...
We show that, for any set of n points in d dimensions, there exists a hyperplane with regression dep...
We prove that the maximum number of k-sets in a set S of n points in IR 3 is O(nk 3=2 ). This im...