Abstract

This paper describes algorithms that fit geometric shapes to data sets according to maximum- inscribed (MI) and minimum- circumscribed (MC) fit. We use these fits to build the CMM’s (Coordinate Measuring Machine) software in cases of circle, sphere and cylinder. For each case, we obtain the fit by two methods: first, by (relative easy) least squares fit method and then refine by MI and MC fit method. Although, the later method is substantially more complicated than the former one, Its results are used to make comparision with the the results of least squares method in order to give more options in the CMM software. In the near future we will continue to develop MI and MC fit with an effective algorithm- Simulated Annealing algorithm.