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 element of P a strong centerpoint of P w.r.t..F if x is contained in all F is an element of F that contains more than cn points of P, where c is a fixed constant. A strong centerpoint does not exist even when F is the family of halfspaces in the plane. We prove the existence of strong centerpoints with exact constants for convex polytopes defined by a fixed set of orientations. We also prove the existence of strong centerpoints for abstract set systems with bounded intersection. (C) 2014 Elsevier B.V. All rights reserved
We introduce a concept that generalizes several different notions of a “centerpoint” in the literatu...
A centrally symmetric plane curve has a point called it's centre of symmetry. We define (following J...
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...
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 pla...
GeneralThe Centerpoint Theorem states that, for any set S of n points in R(d), there exists a point ...
AbstractUsing a technique that Tverberg and Vrecica (1993) [16] discovered to give a surprisingly si...
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...
This dissertation investigates general center points of polygons and convex bodies and some of their...
Strong restricted-orientation convexity is a generalization of standard convexity. We explore the pr...
Strong O-convexity is a generalization of standard convexity, defined with respect to a fixed set O ...
Strong O-convexity is a generalization of standard convexity, defined with respect to a fixed set O ...
AbstractGeneral planar center points are defined via optimization theory as the minimizing solutions...
We introduce a concept that generalizes several different notions of a “centerpoint” in the literatu...
A centrally symmetric plane curve has a point called it's centre of symmetry. We define (following J...
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...
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 pla...
GeneralThe Centerpoint Theorem states that, for any set S of n points in R(d), there exists a point ...
AbstractUsing a technique that Tverberg and Vrecica (1993) [16] discovered to give a surprisingly si...
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...
This dissertation investigates general center points of polygons and convex bodies and some of their...
Strong restricted-orientation convexity is a generalization of standard convexity. We explore the pr...
Strong O-convexity is a generalization of standard convexity, defined with respect to a fixed set O ...
Strong O-convexity is a generalization of standard convexity, defined with respect to a fixed set O ...
AbstractGeneral planar center points are defined via optimization theory as the minimizing solutions...
We introduce a concept that generalizes several different notions of a “centerpoint” in the literatu...
A centrally symmetric plane curve has a point called it's centre of symmetry. We define (following J...
In 2008, Bukh, Matoušek, and Nivasch conjectured that for every n-point set S in ℝd and every k, 0 ≤...