An improvement on the Rado bound for the centerline depth
From MaRDI portal
Publication:1704902
DOI10.1007/s00454-016-9848-5zbMath1385.52019arXiv1603.01641OpenAlexW2765403333MaRDI QIDQ1704902
Alexander Magazinov, Attila Pór
Publication date: 13 March 2018
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.01641
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)
Related Items (4)
Ham-sandwich cuts and center transversals in subspaces ⋮ Upper bounds for stabbing simplices by a line ⋮ A center transversal theorem for an improved Rado depth ⋮ Tverberg’s theorem is 50 years old: A survey
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stabbing simplices by points and flats
- On nearly radial marginals of high-dimensional probability measures
- The number of triangles covering the center of an \(n\)-set
- 3264 and All That
- Upper bounds for centerlines
- Characteristic Classes. (AM-76)
- A Theorem on General Measure
This page was built for publication: An improvement on the Rado bound for the centerline depth