Computing the Depth of a Flat
Computational Geometry
2007-05-23 v1
Abstract
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.
Keywords
Cite
@article{arxiv.cs/0009024,
title = {Computing the Depth of a Flat},
author = {Marshall Bern and David Eppstein},
journal= {arXiv preprint arXiv:cs/0009024},
year = {2007}
}
Comments
6 pages, 1 figure, 2-page version to appear in ACM/SIAM SODA 2001