Projective clustering in high dimensions using core-sets
Sariel Har-Peled, Kasturi Varadarajan · 2002
(MATH) Let P be a set of n points in $\Red, and for any integer 0 ≤ k ≤ d--1, let $\RDk(P) denote the minimum over all k-flats $\FLAT$ of maxpεP Dist(p,\FLAT). We present an algorithm that computes, for any 0 1 or j>1.