A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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 datumdoi:10.1016/j.procir.2016.02.104 fatcat:qd5ttehpczcazof25lie33suhi