Exact Primitives for Smallest Enclosing Ellipses

Abstract The problem of finding the unique closed ellipsoid of smallest volume enclosing an n -point set P in d -space (known as the Lowner-John ellipsoid of P (John, 1948)) is an instance of convex programming and can be solved by general methods in time O( n ) if the dimension is fixed (Welzl, 1991; Matousek et al., 1992; Dyer, 1992; Adler and Shamir, 1993). The problem-specific parts of these methods are encapsulated in primitive operations that deal with subproblems of constant size. We derive explicit formulae for the primitive operations of Welzl's randomized method (Welzl, 1991) in dimension d = 2. Compared to previous ones (Silverman and Titterington, 1980; Post, 1982; Schonherr, 1994), these formulae are simpler and faster to evaluate, and they only contain rational expressions, allowing for an exact solution. rights reserved.

[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.