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
Numerical Simulation of Transdermal Insulin Delivery Using a Coated Microneedle in a 2D Skin Model
Milana Tesfamarian, Michael Heisig, Gabriel Wittum et al.
Multi-Stage NeRF for Efficient 3D Coronary Artery Reconstruction from Two Narrow-Angle Angiographic Projections
Deyu Meng, Mojtaba Lashgari, Yiying Wang et al.
Perfectly Guarding Straits: Exact Algorithms for Weak Visibility Polygons
Shouvik Mondal, Udvas Das, Sasanka Roy
Low-Dimensional Embeddings for Gaussian Kernels on Manifolds
Soumik Dutta, Kunal Dutta
Flip Graphs for Eight Points in Three Dimensions Are Connected
Marc Khoury
Computing the minimal perimeter polygon for digital objects in the triangular tiling
Petra Wiederhold