Fast algorithms for computing the smallest k-enclosing circle

Algorithmica (New York)

Volumn 41, Issue 3, 2005, Pages 147-157

  Har Peled, Sariel ^a   Mazumdar, Soham ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Clustering; Outliers; Shape fitting

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; COMPUTER VISION; LEARNING SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES;

CLUSTERING; OUTLIERS; SHAPE FITTING;

ALGORITHMS;

EID: 11244289453     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1123-0     Document Type: Article

References (17)

1. +] P. K. Agarwal, M. de Berg, J. Matoušek, and O. Schwarzkopf. Constructing levels in arrangements and higher order Voronoi diagrams. SIAM J. Comput., 27:654-667, 1998.
2. [AHV] P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Approximating extent measures of points. J. ACM, 51(4):606-635, 2004.
3. [AST] P. K. Agarwal, M. Sharir, and S. Toledo. Applications of parametric searching in geometric optimization. J. Algorithms, 17:292-318, 1994.
4. [BE] M. Bern and D. Eppstein. Approximation algorithms for geometric problems. In D. S. Hochbaum, editor, Approximationg Algorithms for NP-Hard Problems, pages 296-345. PWS, Boston, MA, 1997.
5. [C] T. M. Chan. Low-dimensional linear programming with violations. In Proc. 43rd Annu. IEEE Sympos. Found. Comput. Sci., pages 570-579, 2002.
6. [DLSS] A. Datta, H.-P. Lenhof, C. Schwarz, and M. Smid. Static and dynamic algorithms for k-point clustering problems. J. Algorithms, 19:474-503, 1995.
7. [E] J. Erickson. New lower bounds for convex hull problems in odd dimensions. SIAM J. Comput., 28:1198-1214, 1999.
8. [EE] D. Eppstein and J. Erickson. Iterated nearest neighbors and finding minimal polytopes. Discrete Comput. Geom., 11:321-350, 1994.
9. [ES] J. Erickson and R. Seidel. Better lower bounds on detecting affine and spherical degeneracies. Discrete Comput. Geom., 13:41-57, 1995.
10. [ESZ] A. Efrat, M. Sharir, and A. Ziv. Computing the smallest k-enclosing circle and related problems. Comput. Geom. Theory Appl., 4:119-136, 1994.
11. [GRSS] M. Golin, R. Raman, C. Schwarz, and M. Smid. Simple randomized algorithms for closest pair problems. Nordic J. Comput., 2:3-27, 1995.
12. [HM] S. Har-Peled and S. Mazumdar. Fast algorithms for computing the smallest k-enclosing disc. In Proc. 11th Annu. European Sympos. Algorithms, volume 2832 of Lecture Notes in Computer Science, pages 278-288. Springer-Verlag, Berlin, 2003.
13. [HW] S. Har-Peled and Y. Wang. Shape fitting with outliers. SIAM J. Comput., 33(2):269-285, 2004.
14. [M1] J. Matoušek. On enclosing k points by a circle. Inform. Process. Lett., 53:217-221, 1995.
15. [M2] J. Matoušek. On geometric optimization with few violated constraints. Discrete Comput. Geom., 14:365-384, 1995.
16. [R] M. O. Rabin. Probabilistic algorithms. In J. F. Traub, editor, Algorithms and Complexity: New Directions and Recent Results, pages 21-39. Academic Press, New York, 1976.
17. [S] M. Smid. Closest-point problems in computational geometry. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 877-935. Elsevier B. V. North-Holland, Amsterdam, 2000.