Exact Primitives for Smallest Enclosing Ellipses
暂无分享,去创建一个
[1] 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..
[2] Emo Welzl,et al. Linear Programming - Randomization and Abstract Frameworks , 1996, STACS.
[3] Micha Sharir,et al. A subexponential bound for linear programming , 1992, SCG '92.
[4] Bernd Gärtner,et al. Exact primitives for smallest enclosing ellipses , 1997, SCG '97.
[5] D. Titterington. Estimation of Correlation Coefficients by Ellipsoidal Trimming , 1978 .
[6] N. Shor,et al. New algorithms for constructing optimal circumscribed and inscribed ellipsoids , 1992 .
[7] Kurt Mehlhorn,et al. LEDA: a platform for combinatorial and geometric computing , 1997, CACM.
[8] William L. Ditto,et al. Principles and applications of chaotic systems , 1995, CACM.
[9] Emo Welzl,et al. Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.
[10] L. Danzer,et al. Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper einbeschriebenen Ellipsoiden , 1957 .
[11] Eric Walter,et al. Minimum-volume ellipsoids containing compact sets : Application to parameter bounding , 1994, Autom..
[12] D. Titterington. Optimal design: Some geometrical aspects of D-optimality , 1975 .
[13] I. Adler,et al. A randomization scheme for speeding up algorithms for linear and convex quadratic programming proble , 1990 .
[14] Bernd Gärtner,et al. Smallest Enclosing Ellipses - Fast and Exact , 1997, SoCG 1997.
[15] Martin E. Dyer,et al. A class of convex programs with applications to computational geometry , 1992, SCG '92.
[16] D. Titterington,et al. Minimum Covering Ellipses , 1980 .
[17] Mark J. Post. Minimum spanning ellipsoids , 1984, STOC '84.