Depth in an arrangement of hyperplanes

DOI10.1007/PL00009452zbMath0944.52009OpenAlexW1996385391MaRDI QIDQ1302033

Mia Hubert, Peter J. Rousseeuw

Publication date: 11 September 2000

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009452

zbMATH Keywords

hyperplane arrangementarrangement depth of a pointbounds on maximal depth

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Related Items

On depth and deep points: A calculus. ⋮ Choosing among notions of multivariate depth statistics ⋮ Tverberg-type theorems for intersecting by rays ⋮ The complexity of hyperplane depth in the plane ⋮ Efficient algorithms for maximum regression depth ⋮ Intersecting convex sets by rays ⋮ Tverberg’s theorem is 50 years old: A survey ⋮ Counterexamples to the colorful Tverberg conjecture for hyperplanes