Efficient algorithms for maximum regression depth
type: Item
instance of: scholarly article
title: Efficient algorithms for maximum regression depth
zbMATH Open document ID: 1161.62043
author: Joseph S. B. Mitchell
author: Micha Sharir
author: Bettina Speckmann
author: Marc Van Kreveld
author: Peter Rousseeuw
author: Jack Snoeyink
published in: Discrete \& Computational Geometry
publication date: 2008-08-19T00:00:00Z
Mathematics Subject Classification ID: 62K05
Mathematics Subject Classification ID: 62K25
Mathematics Subject Classification ID: 65C60
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 5313111
zbMATH Keywords: undirected depth
MaRDI profile type: Publication
full work available at URL: s00454-007-9046-6
OpenAlex ID: W2148269135
Wikidata QID: Q56970327
cites work: Robustness of deepest regression
cites work: The deepest regression method
cites work: Regression depth and center points.
cites work: Optimal slope selection via cuttings
cites work: Dynamic planar convex hull operations in near-logarithmic amortized time
cites work: Q5501289
cites work: Cutting hyperplanes for divide-and-conquer
cites work: Halfspace range search: An algorithmic application of k-sets
cites work: An Optimal-Time Algorithm for Slope Selection
cites work: Improved bounds for planar \(k\)-sets and related problems
cites work: A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
cites work: Q3772828
cites work: Constructing Arrangements of Lines and Hyperplanes with Applications
cites work: On the Zone Theorem for Hyperplane Arrangements
cites work: On Envelopes of Arrangements of Lines
cites work: The exact fitting problem in higher dimensions
cites work: The catline for deep regression
cites work: Optimal slope selection via expanders
cites work: A simple algorithm for determining the envelope of a set of lines
cites work: The complexity of hyperplane depth in the plane
cites work: Randomized optimal algorithm for slope selection
cites work: On `\(k\)-sets' in the plane
cites work: Regression Depth
cites work: Depth in an arrangement of hyperplanes
cites work: Q4209824
cites work: Computing depth contours of bivariate point clouds
cites work: \(k\)-sets and random hulls
cites work: Halfspace depth and regression depth characterize the empirical distribution
cites work: High-dimensional computation of the deepest location.
cites work: Point sets with many \(k\)-sets
DBLP publication ID: journals/dcg/KreveldMRSSS08
DOI: 10.1007/S00454-007-9046-6
description: scientific article; zbMATH DE number 5313111