Smallest enclosing disks (balls and ellipsoids)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 555 LNCS, Issue , 1991, Pages 359-370

  Welzl, Emo ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FINITE SET; HIGHER DIMENSIONS; LINEAR PROGRAMMING ALGORITHM; LINEAR TIME; POINT SET; RANDOMIZED ALGORITHMS;

LINEAR PROGRAMMING;

EID: 85030869395     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0038202     Document Type: Conference Paper

References (18)

1. V. Barnett, The ordering of multivariate data, J. Roy. Statist. Soc. Ser. A 139 (176) 318-354
2. F. Behrend, Über die kleinste umbeschriebene und die größte einbeschriebene Ellipse eines konvexen Bereiches, Math. Ann. 115 (1938) 379-411
3. K. L. Clarkson, Las Vegas algorithms for linear and integer programming when the dimension is small, manuscript (1989)
4. L. Danzer, D. Laugwitz and H. Lenz, Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper eingeschriebenen Ellipsoiden, Arch. Math. 8 (1957) 214-219
5. M. E. Dyer and A. M. Frieze, A randomized algorithm for fixed-dimensional linear programming, manuscript (1987)
6. J. Dörflinger and W. Forst, Approximation durch Kreise: Verfahren zur Berechnung der Hüllkugel, manuscript (1991)
7. F. John, Extremum problems with inequalities as subsidiary conditions, in Courant Anniversary Volume (1948) 187-204, New York
8. F. Juhnke, Löwner ellipsoids via semiinfinite optimization and (quasi-) convexity theory, Technische Universität Magdeburg, Sektion Mathematik, Report 4/90 (1990)
9. H. Jung, Über die kleinste Kugel, die eine räumliche Figur einschließt, J. Reine Angew. Math. 123 (1901) 241-257
10. K. Leichtweiß, Über die affine Exzentrizität konvexer Körper, Arch. Math. 10 (1959) 187-199
11. N. Megiddo, Linear-time algorithms for linear programming in ℝ3 and related problems, SIAM J. Comput. 12 (1983) 759-776
12. M. J. Post, Minimum spanning ellipsoids, in “Proc. 16th Annual ACM Symposium on Theory of Computing” (1984) 108-116
13. R. Seidel, Linear programming and convex hulls made easy, in “Proc. 6th Annual ACM Symposium on Computational Geometry” (1990) 211-215
14. R. Seidel, Backwards analysis of randomized algorithms, manuscript (1991)
15. B. W. Silverman and D. M. Titterington, Minimum covering ellipses, SIAM J. Sci. Slat. Comput. 1 (1980) 401-409
16. M. Shark and E. Welzl, A new combinatorial bound for linear programming and related problems, in preparation (1991)
17. Skyum, A simple algorithm for computing the smallest circle, Aarhus University, Report DAIMI PB-314
18. D. M. Titterington, Estimation of correlation coefficients by ellipsoidal trimming, Appl. Statist. 27 (1978) 227-234