- 作者: Sy-Ming Guu ; Du-Ming Tsai
- 中文摘要: In this paper, we consider the problem of measurement of roundness. We propose a nonlinear programming method for computing the minimum radius circumscribing circle (MCC). We show that the corresponding Lagrangian multiplers possess nice geometric meanings. Moreover, its Lagrangian duality enjoys a "nearly linear" formulation in the sense that it has only three linear constraints and "nearly" linear objective function but with two variables in the quadratic part, which appear separately. Thus, the MCC can be solved using a "nearly linear" concave quadratic program. Experimental results reveal that our method is efficient and robust.
- 英文摘要: --
- 中文關鍵字: roundness measurement, minimum radius circumscribing circle, Largangian duality
- 英文關鍵字: --