The complexity of hyperplane depth in the plane
type: Item
instance of: scholarly article
title: The complexity of hyperplane depth in the plane
zbMATH Open document ID: 1066.68141
author: Stefan Langerman
author: William Steiger
published in: Discrete \& Computational Geometry
publication date: 2004-03-07T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 52A99
zbMATH DE Number: 2051395
MaRDI profile type: Publication
full work available at URL: s00454-003-0011-x
OpenAlex ID: W2008520454
cites work: Regression depth and center points.
cites work: Slowing down sorting networks to obtain faster sorting algorithms
cites work: An Optimal-Time Algorithm for Slope Selection
cites work: On k-Hulls and Related Problems
cites work: Q3772828
cites work: Geometric medians
cites work: Computing a centerpoint of a finite planar set of points in linear time
cites work: Efficient algorithms for maximum regression depth
cites work: Q4952599
cites work: Depth in an arrangement of hyperplanes
cites work: Regression Depth
cites work: Q4117205
DOI: 10.1007/S00454-003-0011-X
description: scientific article; zbMATH DE number 2051395