Theory and Algorithms for Weighted Total Least Squares Fitting of Lines, Planes, and Parallel Planes to Support Tolerancing Standards

Abstract

We present the theory and algorithms for fitting a line, a plane, two parallel planes (corresponding to a slot or a slab), or many parallel planes in a total (orthogonal) leastsquares sense to coordinate data that is weighted. Each of these problems is reduced to a simple 3 أ— 3 matrix eigenvalue/eigenvector problem or an equivalent singular value decomposition problem, which can be solved using reliable and readily available commercial software. These methods were numerically verified by comparing them with bruteforce minimization searches. We demonstrate the need for such weighted total leastsquares fitting in coordinate metrology to support new and emerging tolerancing standards, for instance, ISO 144051:2010. The widespread practice of unweighted fitting works well enough when point sampling is controlled and can be made uniform (e.g., using a discrete point contact coordinate measuring machine). However, we show by example that nonuniformly sampled points (arising from many new measurement technologies) coupled with unweighted leastsquares fitting can lead to erroneous results. When needed, the algorithms presented also solve the unweighted cases simply by assigning the value one to each weight. We additionally prove convergence from the discrete to continuous cases of leastsquares fitting as the point sampling becomes dense.