A simple streaming algorithm for minimum enclosing balls

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006

Volumn , Issue , 2006, Pages 139-142

  Zarrabi Zadeh, Hamid ^a   Chan, Timothy M ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY;

DATA POINTS; HIGH DIMENSIONS; MINIMUM ENCLOSING BALL; ONE-PASS; STREAMING ALGORITHM;

APPROXIMATION ALGORITHMS;

EID: 78751680990     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Approximating extent measures of points. Journal of the ACM, 51(4):606–635, 2004.
2. M. Bădoiu and K. L. Clarkson. Smaller core-sets for balls. In Proc. 14th ACM-SIAM Sympos. Discrete Algorithms, pages 801–802, 2003.
3. M. Bădoiu, S. Har-Peled, and P. Indyk. Approximate clustering via core-sets. In Proc. 34th ACM Sympos. Theory Comput., pages 250–257, 2002.
4. T. M. Chan. Faster core-set constructions and data stream algorithms in fixed dimensions. In Proc. 20th ACM Sympos. Comput. Geom., pages 152–159, 2004. Comput. Geom. Theory Appl., to appear.
5. B. Chazelle and J. Matoušek. On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms, 21:579–597, 1996.
6. K. L. Clarkson. Las Vegas algorithms for linear and integer programming. J. ACM, 42:488–499, 1995.
7. O. Egecioglu and B. Kalantari. Approximating the diameter of a set of points in the Euclidean space. Inform. Process. Lett., 32:205–211, 1989.
8. P. Indyk. Better algorithms for high-dimensional proximity problems via asymmetric embeddings. In Proc. 14th ACM-SIAM Sympos. Discrete Algorithms, pages 539–545, 2003.
9. J. Matoušek, M. Sharir, and E. Welzl. A subexponential bound for linear programming. Algorithmica, 16:498–516, 1996.
10. S. M. Muthukrishnan. Data streams: Algorithms and applications. http://athos.rutgers.edu/~muthu/stream-1-1.ps, 2003.
11. E. Welzl. Smallest enclosing disks (balls and ellipsoids). In New Results and New Trends in Computer Science, LNCS 555, pages 359–370, 1991.