Algorithms for bivariate zonoid depth

DOI10.1016/j.comgeo.2007.05.007zbMath1126.65008OpenAlexW2032620872MaRDI QIDQ2456661

Harish Gopala, Pat Morin

Publication date: 19 October 2007

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.05.007

zbMATH Keywords

algorithmszonotopeszonoidsstatistical data depth

Mathematics Subject Classification ID

Related Items (1)

An optimal randomized algorithm for \(d\)-variate zonoid depth

Uses Software

• AS 277

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multivariate dispersion, central regions and depth. The lift zonoid approach
• On a triangle counting problem
• A lower bound for computing Oja depth
• Algorithms for ham-sandwich cuts
• Computing a centerpoint of a finite planar set of points in linear time
• Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.
• The complexity of hyperplane depth in the plane
• Multivariate analysis by data depth: Descriptive statistics, graphics and inference. (With discussions and rejoinder)
• Geometric applications of a randomized optimization technique
• A subexponential bound for linear programming
• Regression depth and center points.
• On the convex layers of a planar set
• Partitioning with two lines in the plane
• On k-Hulls and Related Problems
• Optimal Search in Planar Subdivisions
• An improved bound for k -sets in three dimensions

This page was built for publication: Algorithms for bivariate zonoid depth