Advertisement

Abstract

We show that coresets do not exist for the problem of 2-slabs in \({\mathbb R}^{3}\), thus demonstrating that the natural approach for solving approximately this problem efficiently is infeasible. On the positive side, for a point set P in \({\mathbb R}^{3}\), we describe a near linear time algorithm for computing a (1+ε)-approximation to the minimum width 2-slab cover of P. This is a first step in providing an efficient approximation algorithm for the problem of covering a point set with k-slabs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Sariel Har-Peled
    • 1
  1. 1.Department of Computer ScienceUniversity of IllinoisUrbanaUSA

Personalised recommendations