A minimum spanning ellipse algorithm
Mark J. Post · 1981
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.