A lower bound for computing Oja depth

DOI10.1016/J.IPL.2005.05.014zbMath1184.68552OpenAlexW2085492198MaRDI QIDQ1044726

Greg Aloupis, Erin McLeish

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.05.014

zbMATH Keywords

algorithmscomputational geometrydata depthcomputational statisticsbivariate medians

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Algorithms for bivariate zonoid depth ⋮ Point set stratification and Delaunay depth

Uses Software

• AS 307

Cites Work

• Unnamed Item
• Unnamed Item
• On a notion of data depth based on random simplices
• Descriptive statistics for multivariate distributions
• Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.
• Lower bounds for computing statistical depth.
• Algorithm AS 307: Bivariate Location Depth

This page was built for publication: A lower bound for computing Oja depth