0

Full Content is available to subscribers

Subscribe/Learn More  >

Simulated and Experimental Verification of CMM Feature Fitting Algorithms

[+] Author Affiliations
Prashant Mohan, Jami Shah, Joseph Davidson

Arizona State University, Tempe, AZ

Paper No. DETC2015-46515, pp. V004T05A017; 15 pages
doi:10.1115/DETC2015-46515
From:
  • ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference
  • Volume 4: 20th Design for Manufacturing and the Life Cycle Conference; 9th International Conference on Micro- and Nanosystems
  • Boston, Massachusetts, USA, August 2–5, 2015
  • Conference Sponsors: Design Engineering Division, Computers and Information in Engineering Division
  • ISBN: 978-0-7918-5711-3
  • Copyright © 2015 by ASME

abstract

Coordinate Measuring Machines (CMMs) collect a sampling of points on measured features for use in dimensional metrology. Conformance to specified geometric tolerances is done by analyzing the point cloud to fit the corresponding feature to the point cloud to determine if the simulated feature lies within the specified tolerance limits. Different types of feature fitting algorithms are needed: nominal, minimal/maximal, circumscribing/inscribing, and zone. Studies have shown that the same point cloud data sent to different vendors CMM software, produces different results. It is suspected that some of these algorithms may be inconsistent with the tolerance class definitions in tolerance standards and, in some cases, with shop floor conventional practices. We have previously reported on the development of normative algorithms and a feature fitting library that could be used by all CMMs. This paper gives a summary of those algorithms and then reports on methods used for verification. Three different types of verification methods were used to validate the algorithms developed. The scope of the current work is limited to linear, planar, circular, and cylindrical features. This set of algorithms described conforms to the international Standards for GD&T. In order to reduce the number of points to be analyzed, and to identify the possible candidate points for linear, circular and planar features, 2D and 3D convex hulls are used. For minimum, maximum, and Chebyshev cylinders, geometric search algorithms are used. Algorithms are divided into three major categories: least square, unconstrained, and constrained fits. Primary datums require one sided unconstrained fits for their verification. Secondary datums require one sided constrained fits for their verification. For size and other tolerance verifications, we require both unconstrained and constrained fits. Use of three different methods has validated the robustness, efficiency and accuracy of the algorithms.

Copyright © 2015 by ASME

Figures

Tables

Interactive Graphics

Video

Country-Specific Mortality and Growth Failure in Infancy and Yound Children and Association With Material Stature

Use interactive graphics and maps to view and sort country-specific infant and early dhildhood mortality and growth failure data and their association with maternal

NOTE:
Citing articles are presented as examples only. In non-demo SCM6 implementation, integration with CrossRef’s "Cited By" API will populate this tab (http://www.crossref.org/citedby.html).

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In