Fast implementation of depth contours using topological sweep

zbMATH Open0988.65005MaRDI QIDQ2768366FDOQ2768366

Authors: Kim Miller, Suneeta Ramaswami, Peter Rousseeuw, Toni Sellarès, Diane L. Souvaine, Ileana Streinu, Anja Struyf 

Publication date: 24 March 2002

Recommendations

• Fast implementation of the Tukey depth
• Algorithm AS 307: Bivariate Location Depth
• Computing depth contours of bivariate point clouds
• scientific article; zbMATH DE number 2119711
• scientific article; zbMATH DE number 1203741

zbMATH Keywords

algorithmshypothesis testingrobust estimationrankinggraphical displaydepth contoursTukey medianlocation depth

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Point estimation (62F10) Statistical ranking and selection procedures (62F07) Robustness and adaptive procedures (parametric inference) (62F35)

Cited In (10)

• Computing halfspace depth contours based on the idea of a circular sequence
• Concentration of the empirical level sets of Tukey's halfspace depth
• Algorithms for bivariate zonoid depth
• Title not available (Why is that?)
• Multivariate quantiles and multiple-output regression quantiles: from \(L_{1}\) optimization to halfspace depth
• Optimal algorithms for geometric centers and depth
• Point set stratification and Delaunay depth
• Lower bounds for computing statistical depth.
• Computational geometry and statistical depth measures
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg

This page was built for publication: Fast implementation of depth contours using topological sweep

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768366)