An efficient and robust calculation procedure for the shortest Euclidean distance between an ellipse and a coplanar point is explored. Unlike existing iterative search methods, e.g., Newton-Raphson and non-linear programming methods, the proposed method, by adopting Ferraris' and Cardan's solutions, employs only closed-form solutions. Numerical instability causing inaccuracy in results is examined and amended by a robust implementation scheme. Test results are reported.
|Number of pages||4|
|Journal||Journal of the Chinese Society of Mechanical Engineers, Transactions of the Chinese Institute of Engineers, Series C/Chung-Kuo Chi Hsueh Kung Ch'eng Hsuebo Pao|
|Publication status||Published - 2002 Jun|
All Science Journal Classification (ASJC) codes
- Mechanical Engineering