In tolerancing, the Out-Of-Roundness factor determines the relative circularity of planar shapes. The measurement of concern in this work is the Minimum Radial Separation, as recommended by the American National Standards Institute (ANSI). Here we show that the algorithm given in Le and Lee [6] runs in /9(n 2) time even for convex polygons. Furthermore, we present an optimal O(n) time algorithm...