English

On Strong Centerpoints

Computational Geometry 2015-02-27 v2

Abstract

Let PP be a set of nn points in Rd\mathbb{R}^d and F\mathcal{F} be a family of geometric objects. We call a point xPx \in P a strong centerpoint of PP w.r.t F\mathcal{F} if xx is contained in all FFF \in \mathcal{F} that contains more than cncn points from PP, where cc is a fixed constant. A strong centerpoint does not exist even when F\mathcal{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.

Cite

@article{arxiv.1312.0387,
  title  = {On Strong Centerpoints},
  author = {Pradeesha Ashok and Sathish Govindarajan},
  journal= {arXiv preprint arXiv:1312.0387},
  year   = {2015}
}
R2 v1 2026-06-22T02:18:45.593Z