Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Approximating Smallest Enclosing Balls

  • Conference paper
Computational Science and Its Applications – ICCSA 2004 (ICCSA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3045))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avis, D., Houle, M.E.: Computational aspects of Helly’s theorem and its relatives. Int J. Comp. Geom. Appl. 5, 357–367 (1995)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  3. Bădoiu, M., Clarkson, K.: Optimal core-sets for balls. In: Proc. 14th ACM-SIAM Sympos Discrete Algorithms (SODA), pp. 801–802 (2003)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. Gärtner, B.: A subexponential algorithm for abstract optimization problems. SIAM J. Comput. 24, 1018–1035 (1995) DOI 10.1137/S0097539793250287

    Article  MATH  MathSciNet  Google Scholar 

  8. 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)

    Google Scholar 

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

    Google Scholar 

  10. Gärtner, B., Welzl, E.: On a simple sampling lemma. Electronic Notes Theor. Comput. Sci. (eTCS) 31 (2000)

    Google Scholar 

  11. 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)

    Chapter  Google Scholar 

  12. 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)

    Article  MATH  MathSciNet  Google Scholar 

  13. Grötschel, M., Lovasz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Springer, Heidelberg (1993)

    MATH  Google Scholar 

  14. Hopp, T., Reeve, C.: An algorithm for computing the minimum covering sphere in any dimension. NIST 5831 Tech. Rep., NIST (1996)

    Google Scholar 

  15. 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)

    Google Scholar 

  16. Megiddo, N.: Linear programming in linear time when the dimension is fixed. J. ACM 31(1), 114–127 (1984) DOI 10.1145/2422.322418

    Article  MATH  MathSciNet  Google Scholar 

  17. Megiddo, N.: On the ball spanned by balls. Discrete Comput. Geom. 4, 605–610 (1989)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  19. Ritter, J.: An efficient bounding sphere. In: Glassner, A. (ed.) Graphics Gems, pp. 301–303. Academic Press, London (1990)

    Google Scholar 

  20. Sylvester, J.J.: A question in the geometry of situation. Quarterly J. Mathematics 1, 79 (1857)

    Google Scholar 

  21. Szabo, T., Welzl, E.: Unique sink orientations of cubes. In: Proc. 42nd Ann. Sympos. Foundat. Comp. Sci (FOCS), pp. 547–555 (2001)

    Google Scholar 

  22. 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)

    Chapter  Google Scholar 

  23. Wu, X.: A linear-time simple bounding volume algorithms. In: Kirk, D. (ed.) Graphics Gems III, pp. 301–306. Academic Press, London (1992)

    Google Scholar 

  24. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sony CS Laboratories Inc, Tokyo, Japan

    Frank Nielsen

  2. UAG-DSI-GRIMAAG, Martinique, France

    Richard Nock

Authors
  1. Frank Nielsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard Nock
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  5. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  6. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation