Computing the Depth of a Flat
| dc.creator | Bern, Marshall | |
| dc.creator | Eppstein, David | |
| dc.date | 2000-09-25 | |
| dc.date.accessioned | 2026-07-07T03:16:34Z | |
| dc.date.available | 2026-07-07T03:16:34Z | |
| dc.description | 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. | |
| dc.description | 6 pages, 1 figure, 2-page version to appear in ACM/SIAM SODA 2001 | |
| dc.identifier | https://arxiv.org/abs/cs/0009024 | |
| dc.identifier | http://arxiv.org/abs/cs/0009024 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30403 | |
| dc.subject | Computational Geometry | |
| dc.subject | F.2.2; g.3 | |
| dc.title | Computing the Depth of a Flat | |
| dc.type | text |