Computing the Depth of a Flat
<|reference_start|>Computing the Depth of a Flat: 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.<|reference_end|>
@article{bern2000computing,
    title={Computing the Depth of a Flat},
    author={Marshall Bern, David Eppstein},
    journal={arXiv preprint arXiv:cs/0009024},
    year={2000},
    archivePrefix={arXiv},
    eprint={cs/0009024},
    primaryClass={cs.CG}
}