A new strategy for circularity problems

The evaluation of circularity based on the minimum zone criterion as a non-linear and non-convex problem, which requires a substantial amount of computational effort in general, is investigated. A new strategy for improving the computational efficiency by collecting data points at the farthest and nearest locations from current minimum radial separation center until all collected data points meet the optimum criterion is proposed. A number of mathematical models developed in this paper indicate that the minimum circularity can be determined by using a small number of critical data points. The validated results show that the proposed strategy offers an effective way to identify the critical data points at the early stage of computation and gives an efficient approach to solve the circularity problems, especially when the number of data point is large.