Author name cluster
Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.
STOC Conference 1984 Conference Paper
The notion of a minimum spanning ellipsoid in any dimension is explained. Basic definitions and theorems provide the ideas for an algorithm to find the minimum spanning ellipsoid of a set of points, i.e., the ellipsoid of minimum volume containing the set. The run-time of the algorithm O (n 2 ) independent of dimension, where n is the number of points.
FOCS Conference 1981 Conference Paper
An algorithm to find the minimum spanning ellipse of a convex set of points in the plane, i. e. , the ellipse of minimum area containing the set, is described. The result for higher dimensions is suggested, along with a brief discussion of possible applications.