Parallel computation of bivariate point data depths and display of intrinsic depth segments
From MaRDI portal
Publication:6541538
DOI10.1002/STA4.250MaRDI QIDQ6541538FDOQ6541538
Authors: Jane Holly DeBlois 
Publication date: 19 May 2024
Published in: Stat (Search for Journal in Brave)
Cites Work
- Algorithm AS 307: Bivariate Location Depth
- Breakdown properties of location estimates based on halfspace depth and projected outlyingness
- Introduction to algorithms.
- On the Concept of Depth for Functional Data
- General notions of statistical depth function.
- Descriptive statistics for multivariate distributions
- Exact computation of the halfspace depth
- Multivariate quantiles and multiple-output regression quantiles: from \(L_{1}\) optimization to halfspace depth
- Title not available (Why is that?)
- Computing depth contours of bivariate point clouds
- Title not available (Why is that?)
- On a notion of simplicial depth
- The quickhull algorithm for convex hulls
- Title not available (Why is that?)
- A new linear algorithm for intersecting convex polygons
- Computational Geometry in C
- Fast Computation of Tukey Trimmed Regions and Median in Dimension p > 2
- Title not available (Why is that?)
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)
