A problem in vision that is polynomially solvable

A problem in vision that is polynomially solvable

0.00 Avg rating0 Votes
Article ID: iaor19911893
Country: India
Volume: 28
Start Page Number: 125
End Page Number: 146
Publication Date: Jun 1991
Journal: OPSEARCH
Authors: , ,
Keywords: optimization, manufacturing industries
Abstract:

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

Reviews

Required fields are marked *. Your email address will not be published.