%0 Journal Article
%T Computing the Depth of a Flat
%A Marshall Bern
%A David Eppstein
%J Computer Science
%D 2000
%I arXiv
%X We give algorithms for computing the regression depth of a k-flat for a set of n points in R^d. The running time is O(n^(d-2) + n log n) when 0 < k < d-1, faster than the best time bound for hyperplane regression or for data depth.
%U http://arxiv.org/abs/cs/0009024v1