SODA
2001
ACM
13 years 5 months ago
2001
ACM
We compute the regression depth of a k-flat in a set of n points in Rd, in time O(nd-2 + n log n) for 1 k d - 2. This contrasts with a bound of O(nd-1 + n log n) when k = 0 or
COMPGEOM
2000
ACM
13 years 8 months ago
2000
ACM
The regression depth of a hyperplane with respect to a set of n points in Rd is the minimum number of points the hyperplane must pass through in a rotation to vertical. We general...