The smallest enclosing ball of balls: Combinatorial structure and algorithms

International Journal of Computational Geometry and Applications

Volumn 14, Issue 4-5, 2004, Pages 341-378

  Fischer, Kaspar ^a   Gärtner, Bernd ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Combinatorial algorithms; Inversion transform; Minimum bounding sphere; Smallest enclosing ball; Unique sink orientation

Indexed keywords

EID: 6044256330     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0218195904001500     Document Type: Conference Paper

References (36)

1. M. S. Bazaraa, H. D. Sherali and C. M. Shetty, Nonlinear Programming: Theory and Applications (Wiley, 1979).
2. M. Berger, Geometry (Vols. 1-2) (Springer-Verlag, 1987).
3. M. Bǎdoiu and K. L. Clarkson, Smaller core-sets for balls, in Proc. Fourteenth Ann. ACM-SIAM Symp. Discrete algorithms (Society for Industrial and Applied Mathematics, 2003), pp. 801-802.
4. M. Bǎdoiu, S. Har-Peled and P. Indyk, Approximate clustering via core-sets, in Proc. Thiry-fourth Ann. ACM Symp. Theory of Computing (ACM Press, 2002), pp. 250-257.
5. B. Chazelle and J. Matoušek, On linear-time deterministic algorithms for optimization problems in fixed dimension, J. Algorithms 21 (1996) 579-597.
6. K. L. Clarkson, Las Vegas algorithms for linear and integer programming, J. ACM 42 (1995) 488-499.
7. M. E. Dyer, Linear time algorithms for two- and three-variable linear programs, SIAM J. Comput. 13 (1984) 31-45.
8. M. E. Dyer, A class of convex programs with applications to computational geometry, in Proc. 8th Ann. ACM Symp. Comput. Geom., 1992, pp. 9-15.
9. H. Edelsbrunner, Algorithms in Combinatorial Geometry, EATCS Monographs on Theoretical Computer Science, Vol. 10 (Springer-Verlag, Heidelberg, West Germany, 1987).
10. B. Gärtner, A subexponential algorithm for abstract optimization problems, SIAM J. Comput. 24(5) (1995) 1018-1035.
11. B. Gärtner, Fast and robust smallest enclosing balls, in Proc. 7th Ann. European Symp. Algorithms (ESA), Lecture Notes Comput. Sci., Vol. 1643 (Springer-Verlag, 1999), pp. 325-338.
12. B. Gärtner and E. Welzl, Linear programming - randomization and abstract frameworks, in Proc. 13th Symp. Theoret. Aspects Comput. Sci., Lecture Notes Comput. Sci., Vol. 1046 (Springer-Verlag, 1996), pp. 669-687.
13. B. Gärtner and E. Welzl, Explicit and implict enforcing - randomized optimization, in Computational Discrete Mathematics, LNCS, Vol. 2122 (Springer-Verlag, 2001), pp. 25-46.
14. I. Geigenfeind, Implementation of Miniball-of-Balls using USO-algorithms, Semester thesis, ETH Zürich, 2004.
15. A. Goel, P. Indyk and K. Varadarajan, Reductions among high dimensional proximity problems, in Proc. Twelfth Ann. ACM-SIAM Symp. Discrete Algorithms (Society for Industrial and Applied Mathematics, 2001), pp. 769-778.
16. T. Granlund, GMP, the GNU Multiple Precision Arithmetic Library, 2.0.2 edition, 1996. http://www.swox.com/gmp/.
17. T. H. Hopp and C. P. Reeve, An algorithm for computing the minimum covering sphere in any dimension, Technical Report NISTIR 5831, National Institute of Standards and Technology, 1996.
18. P. M. Hubbard, Approximating polyhedra with spheres for time-critical collision detection, ACM Trans. Graph. 15(3) (1996) 179-210.
19. V. Karamcheti, C. Li, I. Pechtchanski and C. Yap, A core library for robust numeric and geometric computation, in Proc. Fifteenth Ann. Symp. Computational geometry (ACM Press, 1999), pp. 351-359.
20. P. Kumar, J. S. B. Mitchell and E. A. Yildirim, Approximate minimum enclosing balls in high dimensions using core-sets, J. Exp. Algorithmics 8 (2003) 1.1.
21. +-tree: an improved index structure for similarity searches in a high-dimensional feature space, in Proc. 5th Storage and Retrieval for Image and Video Databases SPIE, Vol. 3022, 1997, pp. 110-120.
22. J. Matoušek, M. Sharir and E. Welzl, A subexponential bound for linear programming, Algorithmica 16 (1996) 498-516.
23. 3 and related problems, SIAM J. Comput. 12(4) (1983) 759-776.
24. N. Megiddo, Linear programming in linear time when the dimension is fixed, J. ACM 31 (1984) 114-127.
25. N. Megiddo, On the ball spanned by balls, Discrete Comput. Geom. 4 (1989) 605-610.
26. K. Mehlhorn and S. Näher, LEDA: A Platform for Combinatorial and Geometric Computing (Cambridge University Press, Cambridge, UK, 2000).
27. K. G. Murty, Note on Bard-type scheme for solving the complementarity problem, in Operations Research, Vol. 11, 1974, pp. 123-130.
28. F. Nielsen and R. Nock, Approximating smallest enclosing balls, in Proc. Int. Conf. Computational Science and Its Applications (ICCSA), Lecture Notes in Computer Science, Vol. 3045 (Springer, 2004).
29. A. L. Peressini, F. E. Sullivan and J. J. Uhl, The mathematics of nonlinear programming, Undergraduate Texts in Mathematics (Springer-Verlag, 1988).
30. d, Discrete Comput. Geom. 12 (1994) 189-202.
31. R. Seidel, Personal communication, 1997.
32. T. Szabó and E. Welzl, Unique sink orientations of cubes, in Proc. 42nd Ann. IEEE Symp. Foundations of Computer Science (FOCS), 2001, pp. 547-555.
33. E. Welzl, Smallest enclosing disks (balls and ellipsoids), In H. Maurer, editor, New Results and New Trends in Computer Science, Lecture Notes Comput. Sci., Vol. 555 (Springer-Verlag, 1991), pp. 359-370.
34. H.-M. Will, Computation of additively weighted Voronoi cells for applications in molecular biology, PhD thesis, ETH Zürich, 1998.
35. S. Xu, R. Freund and J. Sun, Solution methodologies for the smallest enclosing circle problem, Computational Optimization and Applications 25 (2003) 283-292.
36. G. Zhou, K.-C. Toh and J. Sun, Efficient algorithms for the smallest enclosing ball problem, to appear in Computational Optimization and Applications, see also http://www.bschool.nus.edu.sg/depart/ds/sunjiehomepage/, accepted in 2004.