Simple and efficient algorithm for the roundness error from polar coordinate measurement data

Evaluation conditions of the minimum circumscribed circle and maximum inscribed circle in Cartesian coordinates are transformed into those in polar coordinates. According to the radius of the measured points, the candidate points for evaluating the minimum circumscribed circle and maximum inscribed circle are divided into three cases which are solved with the corresponding algorithms. Several examples have been used to validate the validity of the proposed algorithm.Evaluation conditions of the minimum circumscribed circle and maximum inscribed circle in Cartesian coordinates are transformed into those in polar coordinates. According to the radius of the measured points, the candidate points for evaluating the minimum circumscribed circle and maximum inscribed circle are divided into three cases which are solved with the corresponding algorithms. Several examples have been used to validate the validity of the proposed algorithm.