High-dimensional shape fitting in linear time

Let P be a set of n points in Rd. The radius of a k-dimensional flat F with respect to P, denoted by RD(F, P), is defined to be maxp∈P dist(F, p), where dist(F, p) denotes the Euclidean distance between p and its projection onto F. The k-flat radius of P, which we denote by Ropt k (P), is the minimum, over all k-dimensional flats F, of RD(F, P). We consider the problem of computing Ropt k (P) for a given set of points P. We are interested in the high-dimensional case where d is a part of the input and not a

• Type: Conference
• Year: 2003
• Where: COMPGEOM
• Authors: Sariel Har-Peled, Kasturi R. Varadarajan
• Keywords: COMPGEOM 2003, Euclidean Distance, K-dimensional flats, K-dimensional flats F