English

Caratheodory's Theorem in Depth

Computational Geometry 2017-04-06 v3 Combinatorics

Abstract

Let XX be a finite set of points in Rd\mathbb{R}^d. The Tukey depth of a point qq with respect to XX is the minimum number τX(q)\tau_X(q) of points of XX in a halfspace containing qq. In this paper we prove a depth version of Carath\'eodory's theorem. In particular, we prove that there exists a constant cc (that depends only on dd and τX(q)\tau_X(q)) and pairwise disjoint sets X1,,Xd+1XX_1,\dots, X_{d+1} \subset X such that the following holds. Each XiX_i has at least cXc|X| points, and for every choice of points xix_i in XiX_i, qq is a convex combination of x1,,xd+1x_1,\dots, x_{d+1}. We also prove depth versions of Helly's and Kirchberger's theorems.

Cite

@article{arxiv.1509.04575,
  title  = {Caratheodory's Theorem in Depth},
  author = {Ruy Fabila-Monroy and Clemens Huemer},
  journal= {arXiv preprint arXiv:1509.04575},
  year   = {2017}
}
R2 v1 2026-06-22T10:57:16.530Z