Parallel computation of bivariate point data depths and display of intrinsic depth segments
From MaRDI portal
Publication:6541538
Cites work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 3776659 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3541764 (Why is no real title available?)
- A new linear algorithm for intersecting convex polygons
- Algorithm AS 307: Bivariate Location Depth
- Breakdown properties of location estimates based on halfspace depth and projected outlyingness
- Computational Geometry in C
- Computing depth contours of bivariate point clouds
- Descriptive statistics for multivariate distributions
- Exact computation of the halfspace depth
- Fast Computation of Tukey Trimmed Regions and Median in Dimension p > 2
- General notions of statistical depth function.
- Introduction to algorithms.
- Multivariate quantiles and multiple-output regression quantiles: from \(L_{1}\) optimization to halfspace depth
- On a notion of simplicial depth
- On the Concept of Depth for Functional Data
- The quickhull algorithm for convex hulls
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)
