Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Theory and algorithm for planar datum establishment using constrained total least-squares

Published

Author(s)

Craig M. Shakarji, Vijay Srinivasan

Abstract

First, we present an efficient algorithm for establishing planar datums that is based on a constrained minimization search based on the L2 norm after forming a convex surface from sampled points. Visualized by Gauss maps, we prove that the problem reduces to a minimization search where the global minimum is localized about the minimizing facet. Second, we highlight advantages of this planar datum, including the major advantage that the datum planes have full mechanical contact with the datum features in stable cases yet are automatically balanced for rocking conditions. These advantages make this definition appealing for standardization.
Proceedings Title
14th CIRP Conference on Computer Aided Tolerancing (CAT)
Conference Dates
May 18-20, 2016
Conference Location
Gothenburg, SE

Keywords

coordinate metrology, datum, geometric dimensioning and tolerancing, least-squares

Citation

Shakarji, C. and Srinivasan, V. (2016), Theory and algorithm for planar datum establishment using constrained total least-squares, 14th CIRP Conference on Computer Aided Tolerancing (CAT), Gothenburg, SE, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=921834 (Accessed April 15, 2024)
Created May 19, 2016, Updated April 18, 2022