A PROBLEM IN VISION THAT IS POLYNOMIALLY SOLVABLE

	In this paper, we consider the problem of fitting the best circle to a given set of points
in R**2. Several criteria are discussed. An O(n**2) algorithm is given when the objective is to 
minimize the maximum absolute deviation.