Centerpoints and Tverberg's technique

DOI10.1016/j.comgeo.2010.03.002zbMath1196.52010OpenAlexW2002097035MaRDI QIDQ982949

Abdul Basit, Saurabh Ray, Nabil H. Mustafa, Sarfraz Raza

Publication date: 28 July 2010

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.03.002

zbMATH Keywords

discrete geometryTverberg's theoremdata depthcenterpoint theoremcenterdisks

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Related Items (1)

An optimal generalization of the colorful Carathéodory theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stabbing simplices by points and flats
• Breakdown properties of location estimates based on halfspace depth and projected outlyingness
• On generalizations of Radon's theorem and the Ham sandwich theorem
• Computing a centerpoint of a finite planar set of points in linear time
• New constructions of weak \(\varepsilon\)-nets
• Regression depth and center points.
• Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension
• An optimal generalization of the centerpoint theorem, and its extensions
• Separators for sphere-packings and nearest neighbor graphs
• A Generalization of Radon's Theorem
• Approximate center points with proofs
• APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
• Intersecting convex sets by rays

This page was built for publication: Centerpoints and Tverberg's technique