k-Centerpoints Conjectures for Pointsets in ℝd

DOI10.1142/S0218195915500107zbMath1344.68260WikidataQ123113166 ScholiaQ123113166MaRDI QIDQ3459046

Mudassir Shabbir, Saurabh Ray, Nabil H. Mustafa

Publication date: 30 December 2015

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

data depthcenterpointray shooting depth

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg

Cites Work

• A new lower bound based on Gromov's method of selecting heavily covered points
• Hitting simplices with points in \(\mathbb R^{3}\)
• Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
• Stabbing simplices by points and flats
• The number of triangles covering the center of an \(n\)-set
• A generalization of Caratheodory's theorem
• Regression depth and center points.
• Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension
• Separators for sphere-packings and nearest neighbor graphs
• APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS