Abstract
We present two novel tailored algorithms for computing arbitrary fine approximations of the smallest enclosing ball of balls. The deterministic heuristics are based on solving relaxed decision problems using a primal-dual method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avis, D., Houle, M.E.: Computational aspects of Helly’s theorem and its relatives. Int J. Comp. Geom. Appl. 5, 357–367 (1995)
Bădoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via coresets. In: Proc. 34th IEEE Sympos Found Comput Sci.(FOCS), pp. 250–257 (2002) DOI 10.1145/509907.509947
Bădoiu, M., Clarkson, K.: Optimal core-sets for balls. In: Proc. 14th ACM-SIAM Sympos Discrete Algorithms (SODA), pp. 801–802 (2003)
Chazelle, B., Matoušek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimension. J Algorithms 21, 579–597 (1996) DOI 10.1006/jagm.1996.0060
Fischer, K., Gärtner, B.: The smallest enclosing ball of balls: combinatorial structure and algorithms. In: Proc 19th ACM Sympos Comput Geom (SoCG), pp. 292–301 (2003) DOI 10.1145/777792.777836
Fischer, K., Gärtner, B., Kutz, M.: Fast smallest-enclosing-ball computation in high dimensions. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 630–641. Springer, Heidelberg (2003)
Gärtner, B.: A subexponential algorithm for abstract optimization problems. SIAM J. Comput. 24, 1018–1035 (1995) DOI 10.1137/S0097539793250287
Gärtner, B.: Fast and robust smallest enclosing balls. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 325–338. Springer, Heidelberg (1999)
Gärtner, B., Schönherr, S.: An efficient, exact, and generic quadratic programming solver for geometric optimization. In: Proc 16th ACM Sympos Comput Geom (SoCG), pp. 110–118 (2000) DOI 10.1145/336154.336191
Gärtner, B., Welzl, E.: On a simple sampling lemma. Electronic Notes Theor. Comput. Sci. (eTCS) 31 (2000)
Gärtner, B., Welzl, E.: Explicit and implicit enforcing - randomized optimization. In: Alt, H. (ed.) Computational Discrete Mathematics. LNCS, vol. 2122, pp. 25–46. Springer, Heidelberg (2001)
Gritzmann, P., Klee, V.: Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. Mathemat. Program 59(2), 163–213 (1993)
Grötschel, M., Lovasz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Springer, Heidelberg (1993)
Hopp, T., Reeve, C.: An algorithm for computing the minimum covering sphere in any dimension. NIST 5831 Tech. Rep., NIST (1996)
Kumar, P., Mitchell, J.S.B., Yıldırım, A.: Computing core-sets and approximate smallest enclosing hyperspheres in high dimensions. ACM J. Exp. Alg. 8(1) (2003)
Megiddo, N.: Linear programming in linear time when the dimension is fixed. J. ACM 31(1), 114–127 (1984) DOI 10.1145/2422.322418
Megiddo, N.: On the ball spanned by balls. Discrete Comput. Geom. 4, 605–610 (1989)
Nesterov, Y.E., Todd, J.E.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optimization 8, 324–364 (1998) DOI 10.1137/S1052623495290209
Ritter, J.: An efficient bounding sphere. In: Glassner, A. (ed.) Graphics Gems, pp. 301–303. Academic Press, London (1990)
Sylvester, J.J.: A question in the geometry of situation. Quarterly J. Mathematics 1, 79 (1857)
Szabo, T., Welzl, E.: Unique sink orientations of cubes. In: Proc. 42nd Ann. Sympos. Foundat. Comp. Sci (FOCS), pp. 547–555 (2001)
Welzl, E.: Smallest enclosing disks (balls and ellipsoids). In: Maurer, H.A. (ed.) New Results and New Trends in Computer Science. LNCS, vol. 555, pp. 359–370. Springer, Heidelberg (1991)
Wu, X.: A linear-time simple bounding volume algorithms. In: Kirk, D. (ed.) Graphics Gems III, pp. 301–306. Academic Press, London (1992)
Zhou, G., Sun, J., Toh, K.C.: Efficient algorithms for the smallest enclosing ball problem in high dimensional space. AMS Fields Institute Communications 37 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nielsen, F., Nock, R. (2004). Approximating Smallest Enclosing Balls. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24767-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-24767-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22057-2
Online ISBN: 978-3-540-24767-8
eBook Packages: Springer Book Archive