A minimum spanning ellipse algorithm
暂无分享，去创建一个
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.
[1] P. Gács,et al. Khachian's Algorithm for Linear Programming. , 1979 .
[2] M. Shamos. Problems in computational geometry , 1975 .
[3] John F. Randolph. Calculus, Analytic Geometry, Vectors , 1967 .
[4] P. Halmos. Finite-Dimensional Vector Spaces , 1960 .