[compgeom-discuss] references for plane-fitting problem

[Stina Bridgeman <bridgeman@hws.edu>]

I am looking for pointers to references and/or algorithms for the following 
problem.  Even a standard name for the problem would be helpful for 
locating references.

The task is to fit a set of at most k planes to a collection of 
n-dimensional points (n >= 3) so as to maximize the number of points within 
some distance d of a plane.  For n > 3, my geometry gets a bit shaky, but 
the idea of a "plane" is something defined by two orthogonal n-dimensional 
vectors.

I think this problem is different from a simple plane-fitting problem (or 
principal components analysis in the high-dimensional case) because part of 
the problem is to also partition the points into k+1 sets (one for each 
plane, plus the ones not matched to a plane).  Approximate solutions are OK.

Thanks.

--

---------------------------------------------------------------------------
Stina Bridgeman                   Dept. of Mathematics and Computer Science
bridgeman@hws.edu                         Hobart and William Smith Colleges
http://math.hws.edu/faculty/bridgeman.html                 Geneva, NY 14456
---------------------------------------------------------------------------

-- 
You are currently subscribed to compgeom-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/compgeom-discuss