Computing a high depth point in the plane

MaRDI QIDQ3497955zbMATH OpenFDO

Authors Stefan Langerman, William Steiger

Publication date 28 May 2008

Mathematics Subject Classification ID

Characterization and structure theory for multivariate probability distributions; copulas (62H05) Multivariate analysis (62H99)

Recommendations

• scientific article; zbMATH DE number 1445286
• The complexity of hyperplane depth in the plane
• Efficient algorithms for maximum regression depth
• On Combinatorial Depth Measures
• scientific article; zbMATH DE number 4213496

Cited in

(11)

• Point set stratification and Delaunay depth
• Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.
• The complexity of hyperplane depth in the plane
• High-dimensional computation of the deepest location.
• Lower bounds for computing statistical depth.
• Opposite-quadrant depth in the plane
• An optimal randomized algorithm for \(d\)-variate zonoid depth
• Computing the depth of a flat
• Ray-shooting depth: computing statistical data depth of point sets in the plane
• Enumerating extreme points in higher dimensions
• scientific article; zbMATH DE number 2119711 (Why is no real title available?)

Describes a project that uses

Uses Software

• AS 307

This page was built for publication: Computing a high depth point in the plane

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