Exact primitives for smallest enclosing ellipses
暂无分享,去创建一个
[1] D. Titterington,et al. Minimum Covering Ellipses , 1980 .
[2] Micha Sharir,et al. A subexponential bound for linear programming , 1992, SCG '92.
[3] L. Danzer,et al. Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper einbeschriebenen Ellipsoiden , 1957 .
[4] Emo Welzl,et al. Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.
[5] D. Titterington. Optimal design: Some geometrical aspects of D-optimality , 1975 .
[6] Martin E. Dyer,et al. A class of convex programs with applications to computational geometry , 1992, SCG '92.
[7] I. Adler,et al. A randomization scheme for speeding up algorithms for linear and convex quadratic programming proble , 1990 .
[8] Micha Sharir,et al. A Subexponential Bound for Linear Programming , 1992, Symposium on Computational Geometry.
[9] W. E. H. B.. Analytical Conies , 1924, Nature.
[10] Bernd Gärtner,et al. Smallest Enclosing Ellipses - Fast and Exact , 1997, SoCG 1997.
[11] Ron Shamir,et al. A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio , 1993, Math. Program..