The complexity of hyperplane depth in the plane

DOI10.1007/s00454-003-0011-xzbMath1066.68141OpenAlexW2008520454MaRDI QIDQ1423588

Stefan Langerman, William Steiger

Publication date: 7 March 2004

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-003-0011-x

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) General convexity (52A99)

Related Items

On the least trimmed squares estimator, Algorithms for bivariate zonoid depth, Efficient algorithms for maximum regression depth, Intersecting convex sets by rays, On approximate range counting and depth, Computing the least quartile difference estimator in the plane, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Optimal Algorithms for Geometric Centers and Depth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient algorithms for maximum regression depth
• Geometric medians
• Depth in an arrangement of hyperplanes
• Computing a centerpoint of a finite planar set of points in linear time
• Regression depth and center points.
• On k-Hulls and Related Problems
• An Optimal-Time Algorithm for Slope Selection
• Regression Depth
• Slowing down sorting networks to obtain faster sorting algorithms