Fast smallest-enclosing-ball computation in high dimensions

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

Volumn 2832, Issue , 2003, Pages 630-641

  Fischer, Kaspar ^a   Gärtner, Bernd ^b   Kutz, Martin ^a  

^a ETH ZURICH   (Switzerland)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL GEOMETRY; DIGITAL ARITHMETIC; GEOMETRY; LINEAR PROGRAMMING; QUADRATIC PROGRAMMING;

APPROXIMATE RESULTS; COMBINATORIAL ALGORITHM; DYNAMIC DATA STRUCTURE; EUCLIDEAN SPACES; FLOATING POINT IMPLEMENTATION; HIGH DIMENSIONS; HIGH-DIMENSIONAL; SIMPLEX ALGORITHM;

ALGORITHMS;

EID: 0142214895     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_57     Document Type: Article

References (14)

1. 3 and related problems. SIAM J. Comput. 12 (1983) 759-776
2. Dyer, M.E.: A class of convex programs with applications to computational geometry. In: Proc. 8th Annu. ACM Sympos. Comput. Geom. (1992) 9-15
3. Welzl, E.: Smallest enclosing disks (balls and ellipsoids). In Maurer, H., ed.: New Results and New Trends in Computer Science. Volume 555 of Lecture Notes Comput. Sci. Springer-Verlag (1991) 359-370
4. Gärtner, B.: Fast and robust smallest enclosing balls. In: Proc. 7th Annual European Symposium on Algorithms (ESA). Volume 1643 of Lecture Notes Comput. Sei., Springer-Verlag (1999) 325-338
5. Gärtner, B., Schönherr, S.: An efficient, exact, and generic quadratic programming solver for geometric optimization. In: Proc. 16th Annu. ACM Sympos. Comput. Geom. (2000) 110-118
6. Ben-Hur, A., Horn, D., Siegelmann, H.T., Vapnik, V.: Support vector clustering. Journal of Machine Learning Research 2 (2001) 125-137
7. Bulatov, Y., Jambawalikar, S., Kumar, P., Sethia, S.: Hand recognition using geometric classifiers (2002) Abstract of presentation for the DIMACS Workshop on Computational Geometry (Rutgers University).
8. Goel, A., Indyk, P., Varadarajan, K.R.: Reductions among high dimensional proximity problems. In: Symposium on Discrete Algorithms. (2001) 769-778
9. Kumar, P., Mitchell, J.S.B., Yildirim, E.A.: Computing core-sets and approximate smallest enclosing hyperspheres in high dimensions (2003) To appear in the Proceedings of ALENEX'03.
10. ILOG, Inc.: ILOG CPLEX 6.5 user's manual (1999)
11. Zhou, G., Toh, K.C., Sun, J.: Efficient algorithms for the smallest enclosing ball problem. Manuscript (2002)
12. Hopp, T.H., Reeve, C.P.: An algorithm for computing the minimum covering sphere in any dimension. Technical Report NISTIR 5831, National Institute of Standards and Technology (1996)
13. Chvátal, V.: Linear programming. W. H. Freeman, New York, NY (1983)
14. Golub, G.H., van Loan, C.F.: Matrix Computations, third edn. Johns Hopkins University Press (1996)