Parallel computation of bivariate point data depths and display of intrinsic depth segments

DOI10.1002/STA4.250MaRDI QIDQ6541538

Jane Holly DeBlois

Publication date: 19 May 2024

Published in: Stat (Search for Journal in Brave)

zbMATH Keywords

parallel computationsimplicial depthOpenMPdata depthTukeycontourdepth

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Descriptive statistics for multivariate distributions
• Breakdown properties of location estimates based on halfspace depth and projected outlyingness
• Computing depth contours of bivariate point clouds
• Exact computation of the halfspace depth
• General notions of statistical depth function.
• Multivariate quantiles and multiple-output regression quantiles: from \(L_{1}\) optimization to halfspace depth
• A new linear algorithm for intersecting convex polygons
• Fast Computation of Tukey Trimmed Regions and Median in Dimension p > 2
• On a notion of simplicial depth
• Computational Geometry in C
• The quickhull algorithm for convex hulls
• Algorithm AS 307: Bivariate Location Depth
• On the Concept of Depth for Functional Data

This page was built for publication: Parallel computation of bivariate point data depths and display of intrinsic depth segments

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