Advertisement

Testing the Quality of Manufactured Balls

  • Prosenjit Bose
  • Pat Morin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1663)

Abstract

We consider the problem of testing the roundness of a manufactured ball, using the finger probing model of Cole and Yap [4]. When the center of the object is known, a procedure requiring O(n 2) probes and O(n 2) computation time is described. (Here n = |1/q|, where q is the quality of the object.) When the center of the object is not known, the procedure requires O(n 2) probes and O(n 4) computation time. We also give lower bounds that show that the number of probes used by these procedures is optimal.

Keywords

Voronoi Diagram Computational Geometry Coordinate Measuring Machine Full Version Conic Recess 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    P. Agarwal, B. Aronov, and M. Sharir. Line transversals of balls and smallest enclosing cylinder in three dimensions. In 8th ACM-SIAM Symposium on Data Structures and Algorithms (SODA), pages 483–492, 1997.Google Scholar
  2. [2]
    P. Bose and P. Morin. Testing the quality of manufactured balls. Technical Report TR-98-08, Carleton University School of Computer Science, 1998.Google Scholar
  3. [3]
    P. Bose and P. Morin. Testing the quality of manufactured disks and cylinders. In Proceedings of the Ninth Annual International Symposium on Algorithms and Computation (ISAAC’98), pages 129–138, 1998.Google Scholar
  4. [4]
    R. Cole and C. K. Yap. Shape from probing. Journal of Algorithms, 8:19–38, 1987.MathSciNetzbMATHCrossRefGoogle Scholar
  5. [5]
    M. deBerg, P. Bose, D. Bremner, S. Ramaswami, and G. Wilfong. Computing constrained minimum-width annuli of point sets. In Proceedings of the 5th Workshop on Data Structures and Algorithms, pages 25–36, 1997.Google Scholar
  6. [6]
    C. A. Duncan, M. T. Goodrich, and E. A. Ramos. Efficient approximation and optimization algorithms for computational metrology. In 8th ACM-SIAM Symposium on Data Structures and Algorithms (SODA), pages 121–130, 1997.Google Scholar
  7. [7]
    H. Ebara, N. Fukuyama, H. Nakano, and Y. Nakanishi. Roundness algorithms using the Voronoi diagrams. In 1st Canadian Conference on Computational Geometry, page 41, 1989.Google Scholar
  8. [8]
    Q. Fu and C. K. Yap. Computing near-centers in any dimension. Unpublished manuscript, 1998.Google Scholar
  9. [9]
    J. Garcia and P. A. Ramos. Fitting a set of points by a circle. In ACM Symposium on Computational Geometry, 1997.Google Scholar
  10. [10]
    V. B. Le and D. T. Lee. Out-of-roundness problem revisited. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(3):217–223, 1991.CrossRefGoogle Scholar
  11. [11]
    K. Mehlhorn, T. Shermer, and C. Yap. A complete roundness classiffication procedure. In ACM Symposium on Computational Geometry, pages 129–138, 1997.Google Scholar
  12. [12]
    P. Ramos. Computing roundness in practice. In European Conference on Computational Geometry, pages 125–126, 1997.Google Scholar
  13. [13]
    U. Roy and X. Zhang. Establishment of a pair of concentric circles with the minimum radial separation for assessing rounding error. Computer Aided Design, 24(3):161–168, 1992.zbMATHCrossRefGoogle Scholar
  14. [14]
    E. Schomer, J. Sellen, M. Teichmann, and C. K. Yap. Efficient algorithms for the smallest enclosing cylinder. In 8th Canadian Conference on Computational Geometry, pages 264–269, 1996.Google Scholar
  15. [15]
    K. Swanson. An optimal algorithm for roundness determination on convex polygons. In Proceedings of the 3rd Workshop on Data Structures and Algorithms, pages 601–609, 1993.Google Scholar
  16. [16]
    C. K. Yap. Exact computational geometry and tolerancing metrology. In David Avis and Jit Bose, editors, Snapshots of Computational and Discrete Geometry, Vol. 3. 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Prosenjit Bose
    • 1
  • Pat Morin
    • 1
  1. 1.Carleton UniversityOttawaCanada

Personalised recommendations