Computing the Depth of a Flat
Marshall Bern, David Eppstein
Abstract
We give algorithms for computing the regression depth of a k-flat for a set of n points in Rd. 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.
Create a lesson
Related papers
Fixed-Radius Neighbourhoods in Three-Dimensional Unit-Cube Graphs
Guangjian Zhang
Projected and Reflected Sliced Wasserstein Kernels for Persistence Diagrams
Julián Uribe Castañeda, Mircea Petrache
Counterexamples to the Happy Edge Conjecture in Plane Spanning Trees
Oswin Aichholzer, Joseph Dorfer, Peter Kramer et al.
Geometric Bin Packing Beyond Convexity: Approximation Schemes without Augmentation
Lucas de Oliveira Silva, Elisa Dell'Arriva, Flávio Keidi Miyazawa
Polyominoes Folding into Four and Five Distinct Boxes
Erik D. Demaine, Toshihiro Shirakawa, Conner Silverstein et al.
Quadratic Reconfiguration of Plane Spanning Paths on Two-Layer Point Sets
Samuel Avril, Yan Gerard, Guilherme D. da Fonseca