Flatness, Cylindricity and Sphericity Assessment Based on the Seven Classes of Symmetry of the Surfaces
Flatness, Cylindricity and Sphericity Assessment Based on the Seven Classes of Symmetry of the Surfaces //// Hindawi Publishing Corporation Home Journals About Us About this Journal Submit a Manuscript Table of Contents Journal Menu Abstracting and Indexing Aims and Scope Annual Issues Article Processing Charges Articles in Press Author Guidelines Bibliographic Information Contact Information Editorial Board Editorial Workflow Free eTOC Alerts Reviewers Acknowledgment Subscription Information Open Special Issues Published Special Issues Special Issue Guidelines Abstract Full-Text PDF Full-Text HTML Linked References How to Cite this Article Advances in Mechanical Engineering Volume 2010 (2010), Article ID 154287, 11 pages doi:10.1155/2010/154287 Research Article <h2>Flatness, Cylindricity and Sphericity Assessment Based on the Seven Classes of Symmetry of the Surfaces</h2> U. Prisco 1 and W. Polini 2
1 Dipartimento di Ingegneria dei Materiali e della Produzione, Università degli Studi di Napoli “Federico II”, Piazzale Tecchio, 80125 Napoli, Italy 2 Dipartimento di Ingegneria Industriale, Università degli Studi di Cassino, via G. di Biasio 43, 03043 Cassino, Italy
Received 17 May 2010; Accepted 6 September 2010
Academic Editor: Duc Truong Pham
Copyright © 2010 U. Prisco and W. Polini. This is an open access article distributed under the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract
Dimensional inspection of a manufactured surface by means of a coordinate measuring machine (CMM) produces a set of Cartesian coordinates. The coordinates are processed to yield the geometric tolerance of the surface. This paper presents a new approach to the evaluation of flatness, cylindricity and sphericity tolerance based on surface invariance with regard to the rigid motions. The proposed algorithm transforms, through homogeneous transformation matrices, the coordinates measured to best fit the reference element of the surface class from which the actual measurements were sampled. The transformation matrix is simplified taking into account the invariance of the sum of the squared normal distances of the measured points from the nominal surface as regards some rigid motions. This invariance is a consequence of the invariance as regards some displacements of the nominal surface from which the data points were sampled. In this way, the number of parameters to be optimised is reduced in comparison with the six parameters characterizing the general homogeneous transform matrix. The methodology was computer implemented and numerical simulations were performed for planes, cylinders, and spheres in order to validate the effectiveness of the approach. The results indicate that the proposed algorithm provides accurate and quick assessments.
1. Introduction
As industry strives towards the increase of product quality, the effects of machining errors on a workpiece need to be notably reduced. This is critical for the manufacturing processes in order to achieve the needed workpiece accuracy. After the machining, it is necessary to verify the possible occurrence of manufacturing errors, in terms of dimensional or geometrical variations of the designed shape. The traditional inspection method of a manufactured part implies several steps: from the inspection plan design with the selection of number and position of sample points to the measurement process, to the identification of an ideal geometric element with known analytical expression that best fits the measured data. Several fitting techniques can be used to determine the substitute geometry, such as the Least Square Method and the Minimum Zone. The final step is the comparison of the evaluated deviations with the imposed tolerances, thus accepting or rejecting the manufactured part.
Nowadays, GPS standards are evolving towards innovative concepts about surfaces classification [ 1 – 3 ]. The modern vision implies a surface classification based on continuous symmetry of geometric objects. This classification is founded on twelve connected Lie subgroups of rigid motion that led to a compact classification of surfaces in seven classes based on their symmetry and invariance with regard to the rigid motions [ 4 – 7 ]. This paper is the first attempt at integrating these principles into a new algorithm for form tolerance assessment.
According to the standards [ 8 , 9 ] of geometric tolerance, a tolerance applied to a feature of a mechanical part creates a 3D portion of space (the tolerance zone), where the feature may be found, and whose geometry, size, position, and orientation are specified through the type of geometric tolerance assigned, its value, and the datum system chosen, respectively.
The conformance of the manufactured parts to the design specifications is evaluated during the inspection phase. In dimensional inspection, the CMM extracts from the real integral feature a finite set of sampled points and generate the so-called extracted integral feature. The extracted integral feature is elaborated to calculate the associated integral feature (even called substitute feature [ 10 ]), that is, the nominal feature that best fits the extracted integral feature, and the corresponding associated derived feature. The deviations of the measured points from the associated integral feature are finally evaluated to yield the form tolerance. For example, to evaluate the straightness error, an ideal straight line has to be established by minimizing, through the choice of a suitable objective function, the maximum deviation between it and the extracted integral feature concerned. The form error is, then, computed as the maximum peak-to-valley distance of the measured points from the associated integral feature. The position error of the actual feature is derived from the estimated parameters of the substitute feature.
In previous works, different objective functions were proposed: sum of the squares of deviations [ 11 ], sum of the squares of normal deviations [ 11 , 12 ], sum of absolute deviations [ 13 , 14 ], and average deviation [ 13 ]. The minimization was carried out based on either direct or random search techniques, Monte Carlo simulation, simplex search, or spiral search techniques. In recent years, a new class of algorithms for the establishment of form tolerance have received much attention [ 15 – 21 ]. This new class, instead of a substitute feature, directly searches the minimum zone of the feature under inspection. For example, in flatness assessment, two parallel planes with minimum distance including the whole cloud of measured points are searched. This method best conforms the ISO standards that define the form tolerance by means of a tolerance zone within which the feature is to be contained. However, this kind of algorithms is very sensitive to asperities, while the methods minimizing an objective function are much less sensitive to asperities and they are mathematically robust [ 22 ].
This paper presents a new theoretical approach for the assessment of form tolerances by sampling a set of measured points. The proposed approach is based on the new concepts under development by the ISO/TC 213: in particular, on the classification of surfaces into seven classes of symmetry. Instead of searching for the best fit substitute feature, the proposed method transforms, through homogeneous transformation matrices, the coordinates measured in order to best fit the reference element of the class of the surface from which the actual measurements were sampled. The best fitting transformation matrix is found by means of the minimization of the sum of the squared normal distances of the points measured from the reference element of the class to which the nominal integral feature under inspection belongs. The transformation matrix is simplified taking into account the invariance of the sum of the squared normal distances of the measured points from the nominal surface. This invariance is a consequence of the invariance as regards some displacements of the nominal surface, and subsequently of its datum. In this way, the number of parameters to be optimized is reduced in comparison with the six parameters characterizing the general homogeneous transformation matrix in 3D. This theoretical approach was implemented into numerical algorithms for the assessment of the flatness, cylindricity, and sphericity tolerances. The new algorithms were tested on both simulated data sets and data reported in literature. In the following, the problem of form tolerance assessment is introduced (Section 2 ). Then, the proposed algorithm is mathematically described (Section 3 ) and applied to flatness (Section 3.1 ), cylindricity (Section 3.2 ), and sphericity (Section 3.3 ) assessment. Finally, the performances of the proposed algorithm are discussed by means of different sets of data (Section 4 ).
2. Traditional Approach to Form Tolerance Assessment
The algorithms for the evaluation of the form tolerance found in the literature search for a substitute feature, that is, a feature of the same geometric nature of the surface from which the measurements were sampled. The substitute feature minimizes the deviation between itself and the extracted integral feature.
In general form, an ideal surface can be express as a set of points: 𝑛 𝑊 = 𝐧 = 𝑥 , 𝑛 𝑦 , 𝑛 𝑧 , 1 𝑇 ∶ 𝑛 𝑥 , 𝑛 𝑦 , 𝑛 𝑧 ∈ ℜ , 𝑤 ( 𝐧 , 𝐬 ) = 0 , ( 1 ) where 𝑤 is a 𝐶 1 function that represents the equation of the nominal surface specified in implicit form.
The function 𝑤 ( 𝐧 , 𝐬 ) contains internally the set of parameters 𝐬 that characterize position, orientation, and size of the feature. For example, 𝑤 for a sphere is 𝑥 − 𝑥 0 2 + 𝑦 − 𝑦 0 2 + 𝑧 − 𝑧 0 2 = 𝑅 2 , ( 2 ) where the feature parameters are ( 𝑥 0 , 𝑦 0 , 𝑧 0 ) that individualize the position of the sphere centre and 𝑅 that specifies its size. 𝑤 is a 𝐶 1 class function when the nominal feature is almost regular (i.e., the normal to the surface at any surface points exists). These types of surfaces are called CMM measurable.
The extracted integral feature is also represented by a set of points: 𝑊 𝑚 = 𝐫 𝑖 = 𝑟 𝑥 𝑖 , 𝑟 𝑦 𝑖 , 𝑟 𝑧 𝑖 , 1 𝑇 ∶ 𝑟 𝑥 𝑖 , 𝑟 𝑦 𝑖 , 𝑟 𝑧 𝑖 ∈ ℜ , ( 3 ) where 𝐫 𝐢 is the 𝑖 t h actual measurement of the 𝑚 measured points.
The vectorial relationship between the measured points and the substitute feature is 𝐫 𝑖 = 𝐧 𝑖 + 𝜺 𝑖 , ( 4 ) where 𝐧 𝑖 = [ 𝑛 𝑥 𝑖 , 𝑛 𝑦 𝑖 , 𝑛 𝑧 𝑖 , 1 ] 𝑇 is the point on the nominal surface such that 𝐫 𝑖 − 𝐧 𝑖 is coincident with the surface normal direction. 𝜺 𝑖 represents the feature error evaluated along the surface normal direction at the point 𝐧 𝑖 . It is the sum of two elementary errors: measurement and manufacturing errors.
At this step the methods proposed in the literature proceed to the search of the set of substitute feature parameters, 𝐬 , by minimizing the deviation between the substitute feature and the extracted integral feature through the minimization of an objective function, that usually has the following expression [ 16 ]: 𝐿 2 ( 𝐬 ) = 𝑚 𝑖 = 1 𝜺 𝑖 ( 𝐬 ) 2 . ( 5 ) This function is easily recognized as the optimization function of the normal least squares. Statistically, the least squares fit is the maximum likelihood estimation assuming normally distributed errors [ 23 ]. An alternative method proposed by Goch [ 24 ] is based on a general 𝐿 𝑝 norm. Using an 𝐿 2 norm for the optimization objective function means to implement the least squares fitting; while an 𝐿 ∞ norm (Chebyshev norm) means to implement a min-max fit. Goch showed that as the value of 𝑝 in 𝐿 𝑝 increases, the fitting algorithm asymptotically approaches a min-max fit.
The minimization of the chosen objective function with respect to the 𝐬 parameters is in general a complex nonlinear problem, so the objective function usually is linearized to find the solution directly.
3. New Approach to Form Tolerance Assessment
Datum concept is the guiding principle of the proposed approach. Datums are mostly used to position a feature in relation to another one [ 3 , 4 ]. In Table 1 for each of the seven classes of symmetry, the minimum set of points, lines, and planes that belong to the same automorphism group as the geometric objects in that class is reported. Those points, lines, and planes may substitute each surface within the same class of symmetry in problems of relative positioning.
Table 1: Seven classes of symmetry. dim(Aut0(S)): dimension of the automorphism group; I: identity motion, [ 3 ].
Positioning a cloud of measured points as regards to its nominal integral feature is the same as positioning the cloud of measured points as regards to a reference element of the class of symmetry to which its nominal integral feature belongs. In this way, the deviation of the measured points from a reference element can be defined as an alternative to the deviation defined by ( 4 ). The deviation is the distance of the measured points from the reference element of the nominal surface to which the cloud of points has to be fitted, while in ( 4 ) the deviation is the error between the measured points and the points on the nominal surface that satisfy the orthogonality condition. This deviation will be characterized for the planar, cylindrical, and spherical surfaces. Thus, instead of finding the parameters of the substitute feature by minimizing the deviation between the substitute feature and the extracted integral feature, the proposed algorithm transforms through an opportune homogeneous matrix the measurement Cartesian coordinates. The best transformation parameters are identified minimizing the distance between the cloud of measured points and a geometric element having the same geometric nature of the reference element of the class of the surface from which the actual measured points were sampled.
By applying a homogeneous coordinate transformation 𝐓 ( 𝐭 ) , the extracted integral feature is roto-translated so that the measured points can minimize their distance from the reference element of the nominal surface. This rigid motion of the measured points is carried out in the coordinate frame of the datum element of the class to which the nominal integral feature under inspection belongs. In this paper, the Roll-Pich-Yaw angles are used to describe the spatial rotations and translations. Therefore, the transformation matrix can be described as [ 6 , 7 ] ⎡ ⎢ ⎢ ⎢ ⎣ 𝐓 ( 𝐭 ) = 𝐶 𝜑 𝐶 𝜃 𝐶 𝜑 𝑆 𝜃 𝑆 𝜓 − 𝑆 𝜑 𝐶 𝜓 𝐶 𝜑 𝑆 𝜃 𝐶 𝜓 + 𝑆 𝜑 𝑆 𝜓 𝑡 𝑥 𝑆 𝜑 𝐶 𝜃 𝑆 𝜑 𝑆 𝜃 𝑆 𝜓 + 𝐶 𝜑 𝐶 𝜓 𝑆 𝜑 𝑆 𝜃 𝐶 𝜓 𝛾 − 𝐶 𝜑 𝑆 𝜓 𝑡 𝑦 − 𝑆 𝜃 𝐶 𝜃 𝑆 𝜓 𝐶 𝜃 𝐶 𝜓 𝑡 𝑧 ⎤ ⎥ ⎥ ⎥ ⎦ 0 0 0 1 , ( 6 ) where 𝐶 and 𝑆 mean Cos and Sin, respectively. The transformation matrix is generally characterized by six degrees of freedom that are the six transformation parameters 𝐭 = [ 𝜓 , 𝜃 , 𝜑 , 𝑡 𝑥 , 𝑡 𝑦 , 𝑡 𝑧 ] , that is, the three rotation angles 𝜓 , 𝜃 , and 𝜑 around the 𝑥 -, 𝑦 -, and 𝑧 -axis of the datum reference system and the three translations 𝑡 𝑥 , 𝑡 𝑦 , and 𝑡 𝑧 along the same axes.
Considering the new definition of the deviation, stated above as opposed to ( 4 ), the objective function to be minimized becomes 𝑄 ( 𝐭 ) = 𝑚 𝑖 = 1 𝐓 ( 𝐭 ) ⋅ 𝐫 𝑖 − 𝐧 𝑖 2 , ( 7 ) where 𝐧 𝑖 represents now the point nearest to 𝐓 ( 𝐭 ) ⋅ 𝐫 𝑖 on the reference element.
The proposed approach presents two advantages. First, the objective function to be minimized has the same transformation parameters, 𝐭 , for all the nominal integral features, while the classical least squares approach uses parameters, which are specific and different for any different geometric features, [ 12 ]. Furthermore, the number of parameters to be minimized, that is the degrees of freedom of the transformation matrix, which in the general case are six, can be reduced considering the invariance properties of the reference element as regards some rigid motions. This invariance produces the invariance of the objective function ( 7 ) according to the same rigid motions that leave invariant the nominal feature under inspection belongs.
The proposed method has an iterative implementation, where ε is the chosen precision of the algorithm. For each iteration 𝑗 and for each measured point, 𝐫 𝑖 𝑗 − 1 , the nearest point on the reference feature, 𝐧 𝑗 𝑖 , is computed. Then, the objective function is minimized searching for the best parameter set 𝐭 𝑗 : 𝑄 𝑗 = 𝑚 𝑖 = 1 𝐓 𝐭 𝑗 𝐫 𝑖 𝑗 − 1 − 𝐧 𝑗 𝑖 2 , ( 8 ) where 𝐓 ( 𝐭 𝑗 ) is the transformation matrix computed for the 𝑗 t h set of parameter 𝐭 𝑗 .
The search of the minimum of the function ( 8 ) is a nonlinear optimisation problem. It was solved using the numerical well-established method of Levenberg-Marquardt [ 25 ] that is very effective when the function to be minimized is a sum of squares.
Finally, the measured points are transformed by 𝐓 ( 𝐭 𝑗 ) : 𝐫 𝑗 𝑖 𝐭 = 𝐓 𝑗 ⋅ 𝐫 𝑖 𝑗 − 1 , ( 9 ) and the convergence criterion is checked, | 𝑄 𝑗 − 𝑄 𝑗 − 1 | < 𝜀 , until the convergence is achieved. The best fit transformation, 𝐓 , is computed by multiplying the transformation matrices found at each step: ∏ 𝐓 = # o f s t e p s 𝑗 = 1 𝐓 𝑗 . The vector of the optimal parameters, extracted from 𝐓 , is henceforward called ̃ ̃ ̃ 𝑡 𝐭 = [ 𝜓 , 𝜃 , 𝜑 , 𝑥 , ̃ 𝑡 𝑦 , ̃ 𝑡 𝑧 ] .
The proposed approach is applied to assess flatness, cylindricity, and sphericity tolerance in the following paragraph.
3.1. Flatness Assessment
The planar class of symmetry includes the surfaces which are invariant under planar displacements that are the two translations parallel to the plane itself and the rotation around the perpendicular to the plane. The reference element of this class will necessarily be a plane. There are, however, infinite planes, all parallel to each other, that can be chosen as a reference element of a surface of planar class. Then, in flatness assessment the measured points are transformed step by step by the algorithm to best fit a plane. Any plane in the Euclidean space could be chosen, but for the sake of simplicity the 𝑥 - 𝑦 plane of the CMM is chosen. This completely characterizes the nearest point of 𝐫 𝑖 and the structure of the objective function.
It is obvious that the nearest point to 𝐫 𝑖 on the nominal plane is the point that has the first two coordinates equal to the first two coordinates of 𝐫 𝑖 and the third equal to zero: 𝐧 𝑖 = [ 𝑟 𝑥 𝑖 , 𝑟 𝑦 𝑖 , 0 , 1 ] 𝑇 . Equation ( 7 ) can be further simplified considering that the objective function in this case is invariant for rotation and translations of the cloud of measured points around 𝑧 -axis and along 𝑥 - and 𝑦 -axis of the plane reference frame, respectively. This invariance is a consequence of the invariance respect to the same displacements of the nominal surface, and subsequently of its reference element. In this way, the number of parameters to be optimised is reduced from 6 to 3, because it is possible to drop out 𝜑 , 𝑡 𝑥 , and 𝑡 𝑦 from ( 7 ), imposing 𝜑 , 𝑡 𝑥 , and 𝑡 𝑦 equal to zero. Then, the generic objective function is replaced for the planar class of symmetry by the following one: 𝑄 ( 𝐭 ) = 𝑚 𝑖 = 1 ⎛ ⎜ ⎜ ⎜ ⎝ ⎡ ⎢ ⎢ ⎢ ⎣ 𝐶 𝜃 𝑆 𝜃 𝑆 𝜓 𝑆 𝜃 𝐶 𝜓 0 0 𝐶 𝜓 − 𝑆 𝜓 0 − 𝑆 𝜃 𝐶 𝜃 𝑆 𝜓 𝐶 𝜃 𝐶 𝜓 𝑡 𝑧 ⎤ ⎥ ⎥ ⎥ ⎦ 0 0 0 1 ⋅ 𝐫 𝑖 − ⎡ ⎢ ⎢ ⎢ ⎣ 𝑟 𝑥 𝑖 𝑟 𝑦 𝑖 0 1 ⎤ ⎥ ⎥ ⎥ ⎦ ⎞ ⎟ ⎟ ⎟ ⎠ 2 , ( 1 0 ) which is simplified to the following form: 𝑄 𝜓 , 𝜃 , 𝑡 𝑧 = 𝑚 𝑖 = 1 − 𝑆 𝜃 ⋅ 𝑟 𝑥 𝑖 + 𝐶 𝜃 𝑆 𝜓 ⋅ 𝑟 𝑦 𝑖 + 𝐶 𝜃 𝐶 𝜓 ⋅ 𝑟 𝑧 𝑖 + 𝑡 𝑧 2 . ( 1 1 ) The set of parameters, ( 𝜓 , 𝜃 , 𝑡 𝑧 ) , on which the objective function depends, is a reduced version of 𝐭 , due to the application of ( 7 ) to the planar geometry. Then, the reduced set of transformation parameters for flatness assessment is 𝐭 = [ 𝜓 , 𝜃 , 𝑡 𝑧 ] . The best fit parameters provided by algorithm are ̃ ̃ ̃ 𝑡 𝐭 = [ 𝜓 , 𝜃 , 𝑧 ] . Thus, ̃ 𝐓 ( 𝐭 ) ⋅ 𝐫 𝑖 , for 𝑖 = 1 , … , 𝑚 , are the measured points transformed to best fit the reference element of the nominal integral feature from which they were sampled.
After the transformation of best fit, it is possible to estimate the flatness tolerance by the application of the tolerance definition supplied by the ASME Y 14.5 standard [ 9 ] . ASME Y 14.5 specifies the maximum peak-to-valley distance ℎ 𝑡 with reference to the nominal plane as given below ℎ 𝑡 = | | 𝑒 m a x | | − | | 𝑒 m i n | | . ( 1 2 ) On the basis of the previous equation, the flatness tolerance can be estimated directly from the points transformed according to the computed parameters of best fitting. Therefore, the flatness tolerance is given by 𝑇 𝑓 = m a x 𝑖 = 1 , . . . , 𝑚 𝑟 ̃ 𝑡 𝑧 𝑖 − m i n 𝑖 = 1 , . . . , 𝑚 𝑟 ̃ 𝑡 𝑧 𝑖 , ( 1 3 ) where 𝑟 𝑡 𝑧 𝑖 is the third coordinate of the 𝑖 t h measured point after the best fit transformation, ̃ 𝐓 ( 𝐭 ) ⋅ 𝐫 𝑖 .
The equation of the best fitting plane in the form 𝑎 𝑥 + 𝑏 𝑦 + 𝑐 𝑧 + 𝑑 = 0 can be obtained transforming the versor normal to the 𝑥 - 𝑦 plane, [ 0 , 0 , 1 , 0 ] 𝑇 , through the generalized displacement: ̃ ̃ ̃ 𝑡 𝑡 = [ − 𝜓 , − 𝜃 , − 𝑧 ] .
The product of the homogeneous matrix, representing the reverse best fit transformation, and the normal versor is ⎡ ⎢ ⎢ ⎢ ⎢ ⎣ 𝐶 ̃ ̃ ̃ 𝑆 ̃ ̃ ̃ ̃ 𝑡 𝜃 𝑆 𝜃 𝑆 𝜓 − 𝑆 𝜃 𝐶 𝜓 0 0 𝐶 𝜓 𝑆 𝜓 0 𝜃 − 𝐶 𝜃 𝑆 𝜓 𝐶 𝜃 𝐶 𝜓 − 𝑧 ⎤ ⎥ ⎥ ⎥ ⎥ ⎦ ⋅ ⎡ ⎢ ⎢ ⎢ ⎣ 0 0 1 0 ⎤ ⎥ ⎥ ⎥ ⎦ = ⎡ ⎢ ⎢ ⎢ ⎢ ⎣ ̃ 𝐶 ̃ 0 ⎤ ⎥ ⎥ ⎥ ⎥ ⎦ 0 0 0 1 − 𝑆 𝜃 𝐶 𝜓 𝑆 𝜓 𝜃 𝐶 𝜓 . ( 1 4 ) Reminding that the coefficients 𝑎 , 𝑏 , and 𝑐 for a plane are proportional to the components of the versor normal to the plane, their values are obviously derived from ( 14 ): ̃ ̃ 𝑎 = − 𝑆 𝜃 𝐶 𝜓 , 𝑏 = 𝑆 𝜓 , 𝑐 = 𝐶 𝜃 𝐶 𝜓 .
The coefficient 𝑑 can be calculated forcing the plane to pass for the origin of the coordinate frame, [ 0 , 0 , 0 , 1 ] 𝑇 , transformed according to ̃ ̃ 𝑡 [ − 𝜓 , − 𝜃 , − 𝑧 ] , that is, for the point ̃ 𝑡 [ 0 , 0 , 0 , − 𝑧 , 0 ] 𝑇 . Then, the plane coefficient 𝑑 is given by the solution of the following equation: ̃ 𝑡 𝑎 ⋅ 0 + 𝑏 ⋅ 0 − 𝑐 ⋅ 𝑧 + ̃ ̃ 𝑡 𝑑 = 0 ⟹ 𝑑 = 𝐶 𝜃 ⋅ 𝐶 𝜓 ⋅ 𝑧 . ( 1 5 )
3.2. Cylindricity Assessment
The cylindrical class of symmetry encompasses all surfaces invariant under a translation and a rotation around the reference element. Their reference element is their axis of rotation, which is unique.
A straight line is the geometric element from which the proposed algorithm minimizes the distance of the transformed points. For the sake of simplicity the 𝑧 -axis of the cylinder reference frame is chosen, that is, the straight line of equation 𝑥 = 0 and 𝑦 = 0 . The nearest point to 𝐫 𝑖 on the datum is the point 𝐧 𝑖 = [ 0 , 0 , 𝑟 𝑧 𝑖 , 1 ] 𝑇 . Equation ( 7 ) can be simplified considering that the objective function in this case is invariant for rotation and translation of the cloud of measured points around 𝑧 -axis and along 𝑧 -axis, respectively. In this way, the number of parameters to be optimised is reduced from 6 to 4, because it is possible to drop out 𝜑 and 𝑡 𝑧 from ( 7 ), imposing 𝜑 and 𝑡 𝑧 equal to zero. Then, the generic objective function, ( 7 ), is replaced for the cylindrical class of symmetry by the following one: 𝑄 𝜓 , 𝜃 , 𝑡 𝑥 , 𝑡 𝑦 = 𝑚 𝑖 = 1 𝐶 𝜃 ⋅ 𝑟 𝑥 𝑖 + 𝑆 𝜃 𝑆 𝜓 ⋅ 𝑟 𝑦 𝑖 + 𝑆 𝜃 𝑆 𝜓 ⋅ 𝑟 𝑧 𝑖 + 𝑡 𝑥 2 + 𝐶 𝜓 ⋅ 𝑟 𝑦 𝑖 − 𝐶 𝜓 ⋅ 𝑟 𝑧 𝑖 + 𝑡 𝑦 2 . ( 1 6 ) The set of parameters, ( 𝜓 , 𝜃 , 𝑡 𝑥 , 𝑡 𝑦 ) , on which the objective function depends, is a reduced version of 𝐭 , due to the application of ( 7 ) to the cylindrical geometry. Then, the reduced set of transformation parameters for cylindricity assessment is 𝐭 = [ 𝜓 , 𝜃 , 𝑡 𝑥 , 𝑡 𝑦 ] . The best fit parameters provided by the algorithm are ̃ ̃ ̃ 𝑡 𝐭 = [ 𝜓 , 𝜃 , 𝑥 , ̃ 𝑡 𝑦 ] . Thus, ̃ 𝐓 ( 𝐭 ) ⋅ 𝑟 𝑖 , for 𝑖 = 1 , … , 𝑚 , are the measured points transformed to best fit the datum of the nominal integral feature from which they were sampled.
Afterwards the individuation of the best fit set of transformation parameters, the cylindricity of the inspected feature can be assessed following the tolerance definition supplied by the ASME Y 14.5 standard [ 9 ]. Thus, the cylindricity of the real feature can be estimated from the points transformed according to the best fit transformation parameter, 𝑟 𝐭 𝐢 ̃ 𝑡 = [ 𝑟 𝑥 𝑖 ̃ 𝑡 , 𝑟 𝑦 𝑖 ̃ 𝑡 , 𝑟 𝑧 𝑖 , 1 ] 𝑇 , as 𝑇 𝑐 = m a x 𝑖 = 1 , . . . , 𝑚 𝑟 ̃ 𝑡 𝑥 𝑖 2 + 𝑟 ̃ 𝑡 𝑦 𝑖 2 − m i n 𝑖 = 1 , . . . , 𝑚 𝑟 ̃ 𝑡 𝑥 𝑖 2 + 𝑟 ̃ 𝑡 𝑦 𝑖 2 . ( 1 7 ) It can sometimes be useful for comparison purpose to find the axis of the measured cylinder inside the cylinder reference frame. The position of this axis can be obtained transforming the versor of the 𝑧 -axis, [ 0 , 0 , 1 , 0 ] 𝑇 , through the generalized displacement: ̃ ̃ ̃ 𝑡 𝑡 = [ − 𝜓 , − 𝜃 , − 𝑥 ̃ 𝑡 , − 𝑦 , 0 ] , representing the transformation inverse to the best fit transformation. The product of the corresponding homogeneous matrix and the 𝑧 -axis versor is ⎡ ⎢ ⎢ ⎢ ⎢ ⎣ 𝐶 ̃ ̃ ̃ ̃ 𝑡 𝜃 − 𝑆 𝜃 𝑆 𝜓 − 𝑆 𝜃 𝐶 𝜓 − 𝑥 ̃ 𝑡 0 𝐶 𝜓 𝑆 𝜓 − 𝑦 𝑆 ̃ ̃ ̃ ⎤ ⎥ ⎥ ⎥ ⎥ ⎦ ⋅ ⎡ ⎢ ⎢ ⎢ ⎣ 0 0 1 0 ⎤ ⎥ ⎥ ⎥ ⎦ = ⎡ ⎢ ⎢ ⎢ ⎢ ⎣ ̃ 𝐶 ̃ 0 ⎤ ⎥ ⎥ ⎥ ⎥ ⎦ 𝜃 − 𝐶 𝜃 𝑆 𝜓 𝐶 𝜃 𝐶 𝜓 0 0 0 0 1 − 𝑆 𝜃 𝐶 𝜓 𝑆 𝜓 𝜃 𝐶 𝜓 . ( 1 8 )
3.3. Sphericity Assessment
The spherical class of symmetry encompasses all surfaces invariant under all rotations about the feature centre (spherical displacement). The reference element of such a surface is a point corresponding to its centre.
The geometric element from which the proposed algorithm minimizes the distance of the transformed points will be, as a consequence, a point. For the sake of simplicity the point 𝐧 𝑖 = [ 0 , 0 , 0 , 1 ] 𝑇 , that is, the origin of the sphere reference system, is chosen. Equation ( 7 ) can be simplified considering that the objective function in this case is invariant for rotations of the cloud of measured points around 𝑥 -, 𝑦 -, and 𝑧 -axis. In this way, the number of parameters to be optimised is reduced from 6 to 3, because it is possible to drop out 𝜓 , 𝜃 , and 𝜑 from ( 7 ), imposing 𝜓 , 𝜃 , and 𝜑 equal to zero. Then, the objective function becomes 𝑄 𝑡 𝑥 , 𝑡 𝑦 , 𝑡 𝑧 = 𝑚 𝑖 = 1 𝑡 𝑥 + 𝑟 𝑥 𝑖 2 + 𝑡 𝑦 + 𝑟 𝑦 𝑖 2 + 𝑡 𝑧 + 𝑟 𝑧 𝑖 2 2 . ( 1 9 ) The set of parameters, ( 𝑡 𝑥 , 𝑡 𝑦 , 𝑡 𝑧 ) , on which the objective function depends, is a reduced version of 𝐭 , due to the application of ( 7 ) to the spherical geometry. Then, the reduced set of transformation parameters for sphericity assessment is 𝐭 = [ 𝑡 𝑥 , 𝑡 𝑦 , 𝑡 𝑧 ] . The best fit parameters provided by the algorithm are ̃ ̃ 𝑡 𝐭 = [ 𝑥 , ̃ 𝑡 𝑦 , ̃ 𝑡 𝑧 ] . Thus, ̃ 𝐓 ( 𝐭 ) 𝐫 𝑖 , for 𝑖 = 1 , … , 𝑚 , are the measured points transformed to best fit the datum of the nominal integral feature from which they were sampled.
Spherical features are feature of size. They are continuous surfaces with possible size, form, and location errors. International Standards, both ISO and ASME [ 8 , 9 ], do not deal with the sphericity tolerance explicitly and, therefore, the concepts of form tolerance present in these standards have to be employed to the control of the sphericity errors, [ 18 , 26 , 27 ]. The profile tolerancing, for line or surfaces, is considered one of the most versatile controls available. It can be used without datums to control the form of a surface. In addiction, when it is used with one or more datums, it contains a degree of orientation and form control. So profile tolerance is used to control the sphericity errors of the feature. After the best fitting step, the origin of the CMM reference system has become the datum of the measured data. Then, the sphericity tolerance can be calculated from the transformed data by means of the following equation: 𝑇 𝑐 = m a x 𝑖 = 1 , . . . , 𝑚 𝑟 ̃ 𝑡 𝑥 𝑖 2 + 𝑟 ̃ 𝑡 𝑦 𝑖 2 + 𝑟 ̃ 𝑡 𝑧 𝑖 2 − m i n 𝑖 = 1 , . . . , 𝑚 𝑟 ̃ 𝑡 𝑥 𝑖 2 + 𝑟 ̃ 𝑡 𝑦 𝑖 2 + 𝑟 ̃ 𝑡 𝑧 𝑖 2 . ( 2 0 ) From the set of best fitting parameters, ̃ ̃ 𝑡 𝐭 = [ 𝑥 , ̃ 𝑡 𝑦 , ̃ 𝑡 𝑧 ] , the position of the centre of the measured spherical feature can be obtained transforming the origin of the reference system, [ 0 , 0 , 0 , 1 ] 𝑇 , through the generalized displacement: ̃ ̃ 𝑡 𝐭 = [ − 𝑥 ̃ 𝑡 , − 𝑦 ̃ 𝑡 , − 𝑧 ] . This displacement represents the inverse of transformation that best fits the measured points to the origin. The position of the centre in the CMM reference system is given by ⎡ ⎢ ⎢ ⎢ ⎢ ⎣ ̃ 𝑡 0 0 0 − 𝑥 ̃ 𝑡 0 0 0 − 𝑦 ̃ 𝑡 0 0 0 − 𝑧 ⎤ ⎥ ⎥ ⎥ ⎥ ⎦ ⋅ ⎡ ⎢ ⎢ ⎢ ⎣ 0 0 0 1 ⎤ ⎥ ⎥ ⎥ ⎦ = ⎡ ⎢ ⎢ ⎢ ⎢ ⎣ − ̃ 𝑡 0 0 0 1 𝑥 − ̃ 𝑡 𝑦 − ̃ 𝑡 𝑧 1 ⎤ ⎥ ⎥ ⎥ ⎥ ⎦ . ( 2 1 ) In this way the location errors of the feature centre can be evaluated.
4. Applications
The above algorithm was implemented on an AMD Athlon, 523 MB, 1800 MHz computer using Mathematica 5.0. The proposed method was tested to verify its correctness using both datasets published in previous papers, for comparative purposes, and datasets created by numerically simulating actual planar, cylindrical, and spherical surfaces. The formers were published in [ 16 , 28 ] for planar surfaces, in [ 17 , 28 ] for cylindrical surfaces, and in [ 29 ] for spherical surfaces. The latter were generated using an appropriate algorithm similar to that used in [ 16 , 17 ]. This algorithm samples points from two nominal features at a given distance, so that the form tolerance is a priori known. For example, to simulate measured points from an actual cylinder, two cylinders with the same axis and with a radius difference equal to the imposed cylindricity error are generated. The measured points are extracted from the surfaces of the two coaxial cylinders. Furthermore, a rigid motion is applied to the cloud of measured points; so that it can be positioned and orientated at will into the CMM reference system. The proposed algorithm was tested on both sparse measurements, that is, measured points randomly generated on the surface, and grid points, that is, measured points generated using a grid superimposed on the surface. The results for these two kinds of datasets were approximately identical. Therefore, this paper shows only the results obtained by a grid of measured points. However, the datasets in [ 16 , 17 , 28 , 29 ] are sparse measurements. For the presented applications, the adopted convergence criterion was the reduction of the magnitude | 𝑄 𝑗 − 𝑄 𝑗 − 1 | < 𝜀 below 10 −5 .
The results of these evaluations using the proposed algorithm for each feature class are reported in Tables 2 , 3 and 4 . In each Table, the values reported in the column Nominal Tolerance are characterized by an indication, reporting the origin of the values. The letter (G) means that the nominal tolerance refers to the relative distance of the two parallel surfaces from which the dataset was generated, (CMM) indicates that the nominal tolerance was evaluated using a least squares technique on a CMM software (the name of the software used can be found in the cited paper), and (MZ) indicates that the nominal value comes from a minimum zone calculation (the method employed is in the corresponding paper).
Table 2: Flatness results. Table 3: Cylindricity results. Table 4: Sphericity results.
Datasets 9 and 10 for flatness assessment, Table 2 , correspond to datasets 1 and 2 reported in [ 16 ] (generated datasets), while datasets 11–15 are the examples 1–5 of [ 28 ] (CMM-flatness datasets). Datasets 9 and 10 for cylindricity assessment, Table 3 , correspond to the datasets 1 and 2 reported in [ 17 ] (generated datasets), while datasets 11–15 correspond to the examples 1–5 in [ 28 ] (CMM-cylindricity datasets). Dataset 10 for sphericity assessment, Table 4 , corresponds to the dataset presented in [ 29 ] (generated) and datasets 11–12 are the datasets 2-3 in [ 30 ] (measurements). The other datasets were generated for each class of symmetry. Five of them are characterized by the same form tolerance but with increasing number of measured points to verify the efficiency and the rate of convergence of the algorithm. The remaining datasets have different orientation inside the CMM reference system and different tolerance form of the feature to test the consistency of the algorithm to different feature characteristics. All the datasets marked with 𝑏 are measurements collected on a portion of a feature. The obtained results were compared with the nominal value of tolerance.
4.1. Flatness Results
The results of the planar cases are presented in Table 2 . Datasets 1–5 prove that a linear relationship exists between the number of measured points and the amount of time, in CPU seconds, the flatness algorithm requires to compute the best fit solution, as shown in Figure 1(a) . These results indicate that the computational effort is a linear function of the number of measured points.
Figure 1: Efficiency of proposed method: (a) flatness assessment, (b) cylindricity assessment, and (c) sphericity assessment.
Figure 2 shows two views of the best fitting procedure applied to the dataset 6. As it can be seen, the measured points move iteration after iteration towards their datum, that is, the 𝑥 - 𝑦 plane.
Figure 2: Best fit of a planar feature (two views of the dataset 6).
For datasets 9 and 10 in the nominal tolerance column, the flatness tolerance computed with the minimum zone method proposed in [ 16 ] is reported, because in the cited paper no nominal tolerance is provided for these datasets.
The proposed algorithm gives flatness estimates that are very close to the values reported in the nominal tolerance column. Besides, the results of the proposed algorithm are nearer to those due to minimum zone than the values obtained by Zeiss algorithm [ 31 ]. Then, it is proven that the proposed method allows to overestimate flatness less than a traditional least squares algorithm, such as Zeiss, does.
4.2. Cylindricity Results
Table 3 shows the results of the cylindricity assessment. The radius of the assessment feature is also given in Table 3 . The amount of time needed to compute the cylindricity tolerance of datasets 1–5 indicates that the computational effort is also in this case a nearly linear function of the number of measured points, as shown in Figure 1(b) . However, the CPU time required for cylindricity assessment is remarkably larger than this required for flatness and sphericity assessment due to the major complexity of the algorithm.
Figure 3 shows two views of the best fitting procedure applied to the dataset 8. The measured points, moving iteration after iteration towards their datum, that is, the 𝑧 -axis, are clearly visible.
Figure 3: Best fit of a cylindrical feature (two views of the dataset 8).
The proposed algorithm gives cylindricity estimates that are very near to the values reported in the nominal tolerance column. Moreover, the results of the proposed algorithm are closer to minimum zone results than the values obtained by Zeiss algorithm. This means that the proposed method allows to overestimate cylindricity less than a traditional least squares algorithm, such as Zeiss, does.
4.3. Spherical Results
Table 4 shows the form errors computed for spherical features. The computational effort is still an almost linear function of the number of data points; see Figure 1(c) . The precision of the algorithm for this class of feature is considerably larger than that feasible for the other classes of symmetry because the best fit requires only a translation of the measured points.
Figure 4 shows the best fitting procedure applied to the dataset 6. The measured points, moving iteration after iteration towards their datum, that is, the origin of the reference frame, are clearly visible.
Figure 4: Best fit of a spherical feature (two views of the dataset 6).
The proposed algorithm gives sphericity estimates that are very near to the values reported in the nominal tolerance column. Moreover, the results of the proposed algorithm are nearer to the minimum zone results than the values obtained by Zeiss algorithm. This surely means that the proposed method allows to overestimate sphericity less than a traditional least squares algorithm, such as Zeiss, does.
The algorithm is also applicable to measured data obtained from portion of surface. Figure 5 shows two views of the best fitting procedure applied to the dataset 8b, which was collected from a portion of a cylinder. Figure 6 shows the algorithm applied to the best fit of a portion of a spherical feature (two views of the dataset 6b).
Figure 5: Best fit of a portion of a cylindrical feature (two views of the dataset 8b). Figure 6: Best fit of a portion of a spherical feature (two views of the dataset 6b). 5. Conclusions
The present work shows a new algorithm to evaluate flatness, cylindricity, and sphericity tolerance that is based on surface invariance with regard to rigid motions. The new algorithm transforms the measured coordinates, through homogeneous transformation matrices, in order to best fit the reference element (datum) of the class of the surface from which the actual measurements were sampled.
The proposed approach was applied to a set of cases in order to validate the effectiveness and the robustness of the approach. The obtained results indicate that the proposed algorithm provides accurate and quick assessment.
In all cases the new method results in a smaller zone values than the classical least squares methods. The proposed algorithm gives flatness, cylindricity, and sphericity estimates that are very near to minimum zone results. Moreover, the results of the proposed algorithm are nearer to those due to minimum zone than the values obtained by Zeiss algorithm. It is demonstrated that the proposed method allows to overestimate form tolerance less than a traditional least squares algorithm, such as Zeiss, does. Then, it is proven that the proposed method is a favourable alternative to the classical least squares algorithms for form tolerance assessment.
<h4>References</h4> Homepage of ISO/TC 213, President: Dr. Henrik S. Nielsen, 10219 Coral Reef Way, Indianapolis, IN 46256, USA, November 2008, http://isotc213.ds.dk . ISO/TS 17450:1999, “Geometrical product specification (GPS)—model for geometric specification and verification,” International Organization for Standardization, Geneva, Switzerland, 1999. V. Srinivasan, “A geometrical product specification language based on a classification of symmetry groups,” CAD Computer Aided Design , vol. 31, no. 11, pp. 659–668, 1999. A. Desrochers and A. Rivière, “A matrix approach to the representation of tolerance zones and clearances,” International Journal of Advanced Manufacturing Technology , vol. 13, no. 9, pp. 630–636, 1997. A. Clemant, A. Riviere, and M. Temmerman, Cotation Tridimensionelle des Systemes Mecaniques , Ivry-sur-Seine, Paris, France, PYC edition, 1994. O. W. Salomons, Specifying and solving tolerance constraints based on the TTRS concept, computer support in the design of mechanical products , Ph.D. dissertation, University of Twente, Twente, The Netherlands, 1995. U. Prisco and G. Giorleo, “Overview of current CAT systems,” Integrated Computer-Aided Engineering , vol. 9, no. 4, pp. 373–387, 2002. ISO 1101, Technical drawings-Geometrical tolerancing-Tolerancing of form, orientation, location and run out-Generalities, definitions, symbols, indication on drawings. ANSI Y14.5M-1982, National Standard on Dimensioning and Tolerancing , ASME, New York, NY, USA, 1982. E. Capello and Q. Semeraro, “ The harmonic fitting method for the assessment of the substitute geometry estimate error. Part I: 2D and 3D theory ,” International Journal of Machine Tools and Manufacture , vol. 41, no. 8, pp. 1071–1102, 2001. T. S. R. Murthy and S. Z. Abdin, “Minimum zone evaluation of surfaces,” International Journal of Machine Tool Design and Research , vol. 20, no. 2, pp. 123–136, 1980. M. S. Shummugam, “On assessment of geometry errors,” International Journal of Production Research , vol. 245, pp. 413–425, 1986. M. S. Shunmugam, “New approach for evaluating form errors of engineering surfaces,” Computer-Aided Design , vol. 19, no. 7, pp. 368–374, 1987. Y. Wang, “Minimum zone evaluation of form tolerances,” Manufacturing Review , vol. 5, no. 3, pp. 213–220, 1992. U. Roy and X. Zhang, “Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error,” Computer-Aided Design , vol. 24, no. 3, pp. 161–168, 1992. K. Carr and P. Ferreira, “Verification of form tolerances part I: basic issues, flatness, and straightness,” Precision Engineering , vol. 17, no. 2, pp. 131–143, 1995. K. Carr and P. Ferreira, “Verification of form tolerances part II: cylindricity and straightness of a median line,” Precision Engineering , vol. 17, no. 2, pp. 144–156, 1995. G. L. Samuel and M. S. Shunmugam, “ Evaluation of sphericity error from form data using computational geometric techniques ,” International Journal of Machine Tools and Manufacture , vol. 42, no. 3, pp. 405–416, 2002. S. Damodarasamy and S. Anand, “ Evaluation of minimum zone for flatness by normal plane method and simplex search ,” IIE Transactions , vol. 31, no. 7, pp. 617–626, 1999. J.-Y. Lai and I.-H. Chen, “ Minimum zone evaluation of circles and cylinders ,” International Journal of Machine Tools and Manufacture , vol. 36, no. 4, pp. 435–451, 1996. C.-H. Liu, W.-Y. Jywe, and C.-K. Chen, “ Quality assessment on a conical taper part based on the minimum zone definition using genetic algorithms ,” International Journal of Machine Tools and Manufacture , vol. 44, no. 2-3, pp. 183–190, 2004. H.-T. Yau and C.-H. Menq, “ A unified least-squares approach to the evaluation of geometric errors using discrete measurement data ,” International Journal of Machine Tools and Manufacture , vol. 36, no. 11, pp. 1269–1290, 1996. W. Choi and T. R. Kurfess, “Dimensional measurement data analysis, part 1: a zone fitting algorithm,” Journal of Manufacturing Science and Engineering, Transactions of the ASME , vol. 121, no. 2, pp. 238–245, 1999. G. Goch and H. J. Renker, “ Efficient multi-purpose algorithm for approximation and alignment problems in coordinate measurement techniques ,” Annals of CIRP , vol. 39, no. 1, pp. 553–556, 1990. P. R. Gill, W. Murray, and M. H. Wright, “The Levenberg-Marquardt method,” in Practical Optimization , pp. 136–137, Academic Press, London, UK, 1981. G. L. Samuel and M. S. Shunmugam, “ Evaluation of circularity and sphericity from coordinate measurement data ,” Journal of Materials Processing Technology , vol. 139, no. 1–3, pp. 90–95, 2003. G. L. Samuel and M. S. Shunmugam, “ Evaluation of sphericity error from coordinate measurement data using computational geometric techniques ,” Computer Methods in Applied Mechanics and Engineering , vol. 190, no. 51-52, pp. 6765–6781, 2001. T. Weber, S. Motavalli, B. Fallahi, and S. H. Cheraghi, “ A unified approach to form error evaluation ,” Precision Engineering , vol. 26, no. 3, pp. 269–278, 2002. K.-C. Fana and J.-C. Lee, “ Analysis of minimum zone sphericity error using minimum potential energy theory ,” Precision Engineering , vol. 23, no. 2, pp. 65–72, 1999. X. Wen and A. Song, “ An immune evolutionary algorithm for sphericity error evaluation ,” International Journal of Machine Tools and Manufacture , vol. 44, no. 10, pp. 1077–1084, 2004. Calypso Guidebook, 2005, 3D Metrology Services, Carl Zeiss 3D Metrology Services, Aalen, 2-25 2-26. //
http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png
http://www.deepdyve.com/lp/hindawi-publishing-corporation/flatness-cylindricity-and-sphericity-assessment-based-on-the-seven-n4AvtONgYK

/lp/hindawi-publishing-corporation/flatness-cylindricity-and-sphericity-assessment-based-on-the-seven-n4AvtONgYK

- With DeepDyve, you can stop worrying about how much articles cost, or if it's too much hassle to order — it's all at your fingertips. Your research is important and deserves the top content.
- Read from thousands of the leading scholarly journals from
*Springer, Elsevier, Nature, IEEE, Wiley-Blackwell*and more. - All the latest content is available, no embargo periods.

- We’ll send you automatic email updates on the keywords and journals you tell us are most important to you.
- There is a lot of content out there, so we help you sift through it and stay organized.

## “Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”

Daniel C.

## “Woah! It’s like Spotify but for academic articles.”

@Phil_Robichaud

## “I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”

@deepthiw

## “My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”

@JoseServera

Read and share from thousands of top scholarly journals.

System error. Please try again!

or

By signing up, you agree to DeepDyve's Terms of Service and Privacy Policy.

Already have an account? Log in

Your PayPal account has been charged $**0**.

Your
credit card
has been charged **$0**.

You can now print this article. A purchase receipt has also been sent to your email address.

Read and share from thousands of top scholarly journals.

System error. Please try again!

or

By signing up, you agree to DeepDyve's Terms of Service and Privacy Policy.

Already have an account? Log in