No, coreset, no cry

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

Volumn 3328, Issue , 2004, Pages 324-335

  Har Peled, Sariel ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; GEOMETRY; PROBLEM SOLVING; APPROXIMATION ALGORITHMS; SOFTWARE ENGINEERING;

CORE SET; EFFICIENT APPROXIMATION ALGORITHMS; LINEAR-TIME ALGORITHMS; NATURAL APPROACHES; NEAR-LINEAR TIME; POINT SET; POSITIVE SIDES;

APPROXIMATION ALGORITHMS; PROBLEM SOLVING;

EID: 35048833881     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30538-5_27     Document Type: Article

References (33)

1. Agarwal, P.K., Sharir, M.: Efficient algorithms for geometric optimization. ACM Comput. Surv. 30 (1998) 412-458
2. Bern, M., Eppstein, D.: Approximation algorithms for geometric problems. In Hochbaum, D.S., ed.: Approximating algorithms for NP-Hard problems. PWS Publishing Company (1997) 296-345
3. Agarwal, P.K., Aronov, B., Sharir, M.: Computing envelopes in four dimensions with applications. SIAM J. Comput. 26 (1997) 1714-1732
4. Agarwal, P.K., Sharir, M.: Efficient randomized algorithms for some geometric optimization problems. Discrete Comput. Geom. 16 (1996) 317-337
5. Agarwal, P.K., Sharir, M., Toledo, S.: Applications of parametric searching in geometric optimization. J. Algorithms 17 (1994) 292-318
6. Ebara, H., Fukuyama, N., Nakano, H., Nakanishi, Y.: Roundness algorithms using the Voronoi diagrams. In: Proc. 1rd Canad. Conf. Comput. Geom. (1989) 41
7. Edelsbrunner, H., Guibas, L.J., Stolfi, J.: Optimal point location in a monotone subdivision. SIAM J. Comput. 15 (1986) 317-340
8. García-Lopez, J., Ramos, P., Snoeyink, J.: Fitting a set of points by a circle. Discrete Comput. Geom. 20 (1998) 389-402
9. Le, V.B., Lee, D.T.: Out-of-roundness problem revisited. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-13 (1991) 217-223
10. Mehlhorn, K., Shermer, T.C., Yap, C.K.: A complete roundness classification procedure. In: Proc. 13th Annu. ACM Sympos. Comput. Geom. (1997) 129-138
11. Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer-Verlag, New York, NY (1985)
12. Rivlin, T.J.: Approximating by circles. Computing 21 (1979) 93-104
13. Roy, U., Liu, C.R., Woo, T.C.: Review of dimensioning and tolerancing: Representation and processing. Comput. Aided Design 23 (1991) 466-483
14. Roy, U., Zhang, X.: Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error. Comput. Aided Design 24 (1992) 161-168
15. Shermer, T.C., Yap, C.K.: Probing for near centers and relative roundness. In: Proc. ASME Workshop on Tolerancing and Metrology. (1995)
16. Smid, M., Janardan, R.: On the width and roundness of a set of points in the plane. Internat. J. Comput. Geom. Appl. 9 (1999) 97-108
17. Yap, C.K., Chang, E.C.: Issues in the metrology of geometric tolerancing. In Laumond, J.P., Overmars, M.H., eds.: Robotics Motion and Manipulation. A. K. Peters (1997) 393-400
18. Chan, T.M.: Approximating the diameter, width, smallest enclosing cylinder and minimum-width annulus. Internat. J. Comput. Geom. Appl. 12 (2002) 67-85
19. Agarwal, P.K., Aronov, B., Har-Peled, S., Sharir, M.: Approximation and exact algorithms for minimum-width annuli and shells. Discrete Comput. Geom. 24 (2000) 687-705
20. Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM 51 (2004) 606-635
21. Gonzalez, T.: Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci. 38 (1985) 293-306
22. Agarwal, P.K., Procopiuc, C.M.: Exact and approximation algorithms for clustering. Algorithmica 33 (2002) 201-226
23. Agarwal, P.K., Procopiuc, C.M., Varadarajan, K.R.: Approximation algorithms for k-line center. In: Proc. 10th Annu. European Sympos. Algorithms. (2002) 54-63
24. Megiddo, N.: On the complexity of some geometric problems in unbounded dimension. J. Symb. Comput. 10 (1990) 327-334
25. Har-Peled, S., Varadarajan, K.R.: High-dimensional shape fitting in linear time. Discrete Comput. Geom. 32 (2004) 269-288
26. Megiddo, N., Tamir, A.: On the complexity of locating linear facilities in the plane. Oper. Res. Lett. 1 (1982) 194-197
27. Bǎdoiu, M., Clarkson, K.L.: Optimal core-sets for balls. In: Proc. 14th ACM-SIAM Sympos. Discrete Algorithms. (2003) 801-802
28. Har-Peled, S., Varadarajan, K.R.: Projective clustering in high dimensions using core-sets. In: Proc. 18th Annu. ACM Sympos. Comput. Geom. (2002) 312-318
29. Bǎdoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proc. 34th Annu. ACM Sympos. Theory Comput. (2002) 250-257
30. Kumar, P., Mitchell, J.S.B., Yildirim, E.A.: Fast smallest enclosing hypersphere computation. In: Proc. 5th Workshop Algorithm Eng. Exper. (2003) to appear
31. Har-Peled, S., Wang, Y.: Shape fitting with outliers. SIAM J. Comput. 33 (2004) 269-285
32. Har-Peled, S.: Clustering motion. Discrete Comput. Geom. 31 (2004) 545-565
33. Houle, M.E., Toussaint, G.T.: Computing the width of a set. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-10 (1988) 761-765