Computing the depth of a flat

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

• Type: Conference
• Year: 2001
• Where: SODA
• Authors: Marshall W. Bern
• Keywords: Algorithms, Compute, Regression Depth, SODA 2001